Publication

Using Structural Properties for Integer Programs

Publications associées (30)

Fair colorful k-center clustering

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

SPRINGER HEIDELBERG2022

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

Robust Learning-Augmented Caching: An Experimental Study

Adam Teodor Polak

Effective caching is crucial for performance of modern-day computing systems. A key optimization problem arising in caching – which item to evict to make room for a new item – cannot be optimally solved without knowing the future. There are many classical ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Variational Monte Carlo Calculations of A

Giuseppe Carleo

The complexity of many-body quantum wave functions is a central aspect of several fields of physics and chemistry where nonperturbative interactions are prominent. Artificial neural networks (ANNs) have proven to be a flexible tool to approximate quantum m ...

AMER PHYSICAL SOC2021

Integrating advanced discrete choice models in mixed integer linear optimization

Michel Bierlaire, Meritxell Pacheco Paneque, Bernard Gendron

In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Pareto-like sequential sampling heuristic for global optimisation

Katrin Beyer, Mahmoud S. M. Shaqfa

In this paper, we propose a simple global optimisation algorithm inspired by Pareto’s principle. This algorithm samples most of its solutions within prominent search domains and is equipped with a self-adaptive mechanism to control the dynamic tightening o ...

2021

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

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Rico Zenklusen, Ola Nils Anders Svensson, Ashkan Norouzi Fard, Moran Feldman

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

ASSOC COMPUTING MACHINERY2020

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020