177
Voted
IPCO
15 years 3 months ago
2010 
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
121
click to vote
IPCO
15 years 24 days ago
2010 
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
100
Voted
IPCO
15 years 3 months ago
2010 123
click to vote
IPCO
15 years 3 months ago
2010 
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
117
Voted
IPCO
15 years 3 months ago
2010 
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
|
Optimization