Publication
Learning to Remove Cuts in Integer Linear Programming
Related publications (79)
A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks
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-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Better 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 PUBLICATIONS2020Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
Daniel Kuhn, Napat Rujeerapaiboon, Kilian Schindler, Wolfram Wiesemann
Plain vanilla K-means clustering is prone to produce unbalanced clusters and suffers from outlier sensitivity. To mitigate both shortcomings, we formulate a joint outlier-detection and clustering problem, which assigns a prescribed number of datapoints to ...
2019Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials
Dense conditional random fields (CRFs) have become a popular framework for modeling several problems in computer vision such as stereo correspondence and multiclass semantic segmentation. By modeling long-range interactions, dense CRFs provide a labeling t ...
SIAM PUBLICATIONS2019Algorithms For Clustering Problems
Clustering is a classic topic in combinatorial optimization and plays a central role in many areas, including data science and machine learning. In this thesis, we first focus on the dynamic facility location problem (i.e., the facility location problem in ...
EPFL2018From Uncertainty Data to Robust Policies for Temporal Logic Planning
Maryam Kamgarpour, Tony Alan Wood
We consider the problem of synthesizing robust disturbance feedback policies for systems performing complex tasks. We formulate the tasks as linear temporal logic specifications and encode them into an optimization framework via mixed-integer constraints. ...
ACM2018New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials
Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...
EPFL2018Integrating advanced discrete choice models in mixed integer linear optimization
Michel Bierlaire, Shadi Sharif Azadeh, Meritxell Pacheco Paneque, Bernard Gendron
The integration of choice models in mixed integer linear programming (MILP) is appealing to operators because it provides a better understanding of the preferences of customers while planning for their systems. However, the complexity of choice models lea ...
2018The Support Of Integer Optimal Solutions
The support of a vector is the number of nonzero components. We show that given an integral mxn matrix A, the integer linear optimization problem max {c(T) x : Ax = b, x >= 0, x is an element of Z(n)} has an optimal solution whose support is bounded by 2m ...
SIAM PUBLICATIONS2018Integrating Heuristic and Machine-Learning Methods for Efficient Virtual Machine Allocation in Data Centers
David Atienza Alonso, Marina Zapater Sancho, Ali Pahlevan, Xiaoyu Qu
Modern cloud data centers (DCs) need to tackle efficiently the increasing demand for computing resources and address the energy efficiency challenge. Therefore, it is essential to develop resource provisioning policies that are aware of virtual machine (VM ...
2018