IPCO
2010
13 years 2 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
IPCO
2010
13 years 3 months ago
2010
In the classical secretary problem an employer would like to choose the best candidate among
IPCO
2010
13 years 3 months 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...
IPCO
2010
13 years 6 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...
IPCO
2010
13 years 6 months ago
2010
IPCO
2010
13 years 6 months ago
2010
IPCO
2010
13 years 6 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
IPCO
2010
13 years 6 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...
IPCO
2010
13 years 6 months ago
2010
IPCO
2010
13 years 6 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...