Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Branch and bound

Related publications (29)

Improving SAM Requires Rethinking its Optimization Formulation

Volkan Cevher, Kimon Antonakopoulos, Fabian Ricardo Latorre Gomez, Thomas Michaelsen Pethick, Wanyun Xie

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

2024

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Baiwei Guo

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

EPFL2023

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Michel Bierlaire

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

2023

Biobased surfactants

Jeremy Luterbacher, Stefania Bertella, Songlan Sun, Anastasiia Komarova

Compound of the general formula (Ia), (Ib) and (Ic) R50 and R60 are different form each other and are selected from the group consisting of -R70, -ZR70, -Z-OH, -Z-NH2, -Z-SH, -Z-OC(O)R70, -OC(O)R70, - COOH and its corresponding salts, -C(O)NH2, -C(O)NH-R70 ...

2023

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Optimization and equilibrium problems with discrete choice models

Stefano Bortolomiol

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

EPFL2022

Reinforcement Learning-Based Joint Reliability and Performance Optimization for Hybrid-Cache Computing Servers

David Atienza Alonso, Marina Zapater Sancho, Ali Pahlevan, Darong Huang, Luis Maria Costero Valero

Computing servers play a key role in the development and process of emerging compute-intensive applications in recent years. However, they need to operate efficiently from an energy perspective viewpoint, while maximizing the performance and lifetime of th ...

2022

Computational tool for stock-constrained design of structures

Corentin Jean Dominique Fivet, Jan Friedrich Georg Brütting, Jonas Warmuth

Designing structures from reused elements is becoming an increasingly important design task for structural engineers as it has potential to significantly reduce adverse environmental impacts of building structures. To allow for a broad application of this ...

2021

Data reduction for mixed integer linear programming in complex energy systems

François Maréchal, Luc Girardin, Julia Granacher, Luise Middelhauve

The task of optimally designing and scheduling energy systems with a high share of renewable energies is complex and computationally demanding. A widespread method for tackling this task is to apply mixed integer linear programming (MILP). Even though the ...

2021

Automatic locking of a parametrically resonating, base-excited, nonlinear beam

Amit Yedidia Dolev

Described is a closed-loop control scheme capable of stabilizing a parametrically excited nonlinear structure in several vibration modes. By setting the relative phase between the spatially filtered response and the excitation, the open-loop unstable solut ...

SPRINGER2021

Sequential metric dimension for random graphs

Patrick Thiran, Gergely Odor

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

2021

Analytical Computation of Power Grids’ Sensitivity Coefficients with Voltage-Dependent Injections

Mario Paolone, Sherif Alaa Salaheldin Fahmy

With the increasing need of real-time regulation in power systems, grid-aware-control-frameworks are relying more often on sensitivity coefficients (SCs) to formulate and efficiently solve optimal control problems. As known, SCs are the derivatives of cont ...

IEEE2021

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

Sidi-Rachid Cherkaoui, Hossein Sekhavatmanesh

The distribution network restoration problem is by nature a mixed integer and non-linear optimization problem due to the switching decisions and Optimal Power Flow (OPF) constraints, respectively. The link between these two parts involves logical implicati ...

IEEE Institute of Electrical and Electronics Engineers2020

Topology-Finding of Tensegrity Structures Considering Global Stability Condition

Yafeng Wang

This study proposes a general framework for topology-finding or topology optimization of tensegrity structures. The existing topology-finding formulation of tensegrity structures based on mixed-integer linear programming (MILP) was improved and transformed ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Deep Neural Networks With Trainable Activations and Controlled Lipschitz Constant

Michaël Unser, Shayan Aziznejad, Harshit Gupta, Joaquim Gonçalves Garcia Barreto Campos

We introduce a variational framework to learn the activation functions of deep neural networks. Our aim is to increase the capacity of the network while controlling an upper-bound of the actual Lipschitz constant of the input-output relation. To that end, ...

2020

Bootstrapping massive quantum field theories

João Miguel Augusto Penedones Fernandes, Denis Karateev

We propose a new non-perturbative method for studying UV complete unitary quantum field theories (QFTs) with a mass gap in general number of spacetime dimensions. The method relies on unitarity formulated as positive semi-definiteness of the matrix of inne ...

Springer Nature2020

The electric autonomous dial-a-ride problem

Claudia Bongiovanni

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

EPFL2020