Publication

Strengths and Limitations of Linear Programming Relaxations

Related publications (227)

About
Privacy
Disclaimer

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.

Strengths and Limitations of Linear Programming Relaxations

Graph Chatbot

Chat with Graph Search

A note on the integrality gap of the configuration LP for restricted Santa Claus

The electric autonomous dial-a-ride problem

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

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

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

Fair Colorful k-Center Clustering

Topology-Finding of Tensegrity Structures Considering Global Stability Condition

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

New Graph Algorithms via Polyhedral Techniques