Publication

A cutting-plane method for Mixed-Logical Semidefinite Programs with an application to multi-vehicle robust path planning

Related publications (39)

Learning to Remove Cuts in Integer Linear Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

2024

Integrating advanced discrete choice models in mixed integer linear optimization

Michel Bierlaire, 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

Computational tool for stock-constrained design of structures

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

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

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Volkan Cevher, Alp Yurtsever

This paper develops a new storage-optimal algorithm that provably solves almost all semidefinite programs (SDPs). This method is particularly effective for weakly constrained SDPs under appropriate regularity conditions. The key idea is to formulate an app ...

SIAM PUBLICATIONS2021

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

ASCE-AMER SOC CIVIL ENGINEERS2020

Scalable Stochastic Optimization: Scenario Reduction with Guarantees

Kilian Schindler

Stochastic optimization is a popular modeling paradigm for decision-making under uncertainty and has a wide spectrum of applications in management science, economics and engineering. However, the stochastic optimization models one faces in practice are int ...

EPFL2020

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

2019

Optimal Design of Heat-Integrated Water Allocation Networks

François Maréchal, Ivan Daniel Kantor, Maziar Kermani

Industrial operations consume energy and water in large quantities without accounting for potential economic and environmental burdens on future generations. Consumption of energy (mainly in the form of high pressure steam) and water (in the form of proces ...

2019

Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials

Mathieu Salzmann

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 PUBLICATIONS2019

Quasiconvexity and Relaxation in Optimal Transportation of Closed Differential Forms

Bernard Dacorogna

This manuscript extends the relaxation theory from nonlinear elasticity to electromagnetism and to actions defined on paths of differential forms. The introduction of a gauge allows for a reformulation of the notion of quasiconvexity in Bandyopadhyay et al ...

SPRINGER2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.