Publications related to Integer programming

Complexity of linear relaxations in integer programming

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...

2020

Waste collection inventory routing with non-stationary stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We solve a rich routing problem inspired from practice, in which a heterogeneous fixed fleet is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor that communicates its level ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Cong Wang, Roman Rudnik, Jagdish Prasad Achara

An electric vehicle (EV) charging method which considers the EVs heterogeneity, taking into account the absence of any information about future arrivals and departures, and of the amount of time any charging will take. The method further considers both swi ...

2020

A Mixed-Integer Linear Programming Formulation for Optimizing Multi-Scale Material and Energy Integration

François Maréchal, Ivan Daniel Kantor, Hür Ebuzer Bütün

This research presents a mathematical formulation for optimizing integration of complex industrial systems from the level of unit operations to processes, entire plants, and finally to considering industrial symbiosis opportunities between plants. The fram ...

2020

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

Bootstrapping massive quantum field theories

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 ...

SPRINGER2020

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Justin Dean Ward

Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with a provable guarantee is a simple local ...

SIAM PUBLICATIONS2020

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Frédéric Mila, Jonathan D'Emidio

Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models ...

AMER PHYSICAL SOC2020

Optimum design of low environmental impact structures through component reuse

Jan Friedrich Georg Brütting

Load-bearing systems (structures) in buildings and infrastructure contribute to a significant share of adverse environmental impacts (EI) because of resource- and energy-intensive fabrication. A currently overlooked circular economy strategy to reduce EI i ...

EPFL2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Integer programming

Graph Chatbot

Chat with Graph Search

Complexity of linear relaxations in integer programming

Waste collection inventory routing with non-stationary stochastic demands

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

A Mixed-Integer Linear Programming Formulation for Optimizing Multi-Scale Material and Energy Integration

The electric autonomous dial-a-ride problem

Bootstrapping massive quantum field theories

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Optimum design of low environmental impact structures through component reuse

New Results in Integer and Lattice Programming

New Results in Integer and Lattice Programming

Complexity of linear relaxations in integer programming

The electric autonomous dial-a-ride problem

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Bootstrapping massive quantum field theories

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Optimum design of low environmental impact structures through component reuse

Waste collection inventory routing with non-stationary stochastic demands

A Mixed-Integer Linear Programming Formulation for Optimizing Multi-Scale Material and Energy Integration

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint