Sciweavers

IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 9 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
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...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
IPCO
2010
131views Optimization» more  IPCO 2010»
13 years 10 months ago
Secretary Problems via Linear Programming
In the classical secretary problem an employer would like to choose the best candidate among
Niv Buchbinder, Kamal Jain, Mohit Singh
IPCO
2010
210views Optimization» more  IPCO 2010»
13 years 10 months ago
A 3-Approximation for Facility Location with Uniform Capacities
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...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
IPCO
2010
231views Optimization» more  IPCO 2010»
14 years 27 days ago
Branched Polyhedral Systems
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...
Volker Kaibel, Andreas Loos
IPCO
2010
123views Optimization» more  IPCO 2010»
14 years 27 days ago
On Generalizations of Network Design Problems with Degree Bounds
Nikhil Bansal, Rohit Khandekar, Jochen Könema...
IPCO
2010
148views Optimization» more  IPCO 2010»
14 years 27 days ago
Prize-Collecting Steiner Network Problems
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...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
IPCO
2010
174views Optimization» more  IPCO 2010»
14 years 27 days ago
On Lifting Integer Variables in Minimal Inequalities
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...
Amitabh Basu, Manoel B. Campêlo, Michele Con...
IPCO
2010
146views Optimization» more  IPCO 2010»
14 years 27 days ago
Integer Quadratic Quasi-polyhedra
Adam N. Letchford
IPCO
2010
160views Optimization» more  IPCO 2010»
14 years 27 days ago
On Column-Restricted and Priority Covering Integer Programs
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...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...