2011 share record
persistent URL:
Alexander A. Ageev , Yohann Benchetrit , András Sebö , Zoltán Szigeti : An Excluded Minor Characterization of Seymour Graphs. IPCO 2011 : 1-13 share record
persistent URL:
Yu Hin Au , Levent Tunçel : Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. IPCO 2011 : 14-26 share record
persistent URL:
Amitabh Basu , Gérard Cornuéjols , Marco Molinaro : A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011 : 27-38 share record
persistent URL:
Martin Bergner , Alberto Caprara , Fabio Furini , Marco E. Lübbecke , Enrico Malaguti , Emiliano Traversi : Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011 : 39-51 share record
persistent URL:
Pierre Bonami : Lift-and-Project Cuts for Mixed Integer Convex Programs. IPCO 2011 : 52-64 share record
persistent URL:
Sylvia C. Boyd , René Sitters , Suzanne van der Ster , Leen Stougie : TSP on Cubic and Subcubic Graphs. IPCO 2011 : 65-77 export record
dblp key:
conf/ipco/ChakrabartyCKK11 share record
persistent URL:
Deeparnab Chakrabarty , Chandra Chekuri , Sanjeev Khanna , Nitish Korula : Approximability of Capacitated Network Design. IPCO 2011 : 78-91 share record
persistent URL:
Deeparnab Chakrabarty , Chaitanya Swamy : Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011 : 92-103 share record
persistent URL:
William J. Cook , Thorsten Koch , Daniel E. Steffy , Kati Wolter : An Exact Rational Mixed-Integer Programming Solver. IPCO 2011 : 104-116 share record
persistent URL:
Claudia D'Ambrosio , Jeff T. Linderoth , James R. Luedtke : Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011 : 117-129 share record
persistent URL:
Daniel Dadush , Santanu S. Dey , Juan Pablo Vielma : On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO 2011 : 130-142 share record
persistent URL:
Santanu S. Dey , Sebastian Pokutta : Design and Verify: A New Scheme for Generating Cutting-Planes. IPCO 2011 : 143-155 share record
persistent URL:
Aman Dhesi , Pranav Gupta , Amit Kumar , Gyana R. Parija , Sambuddha Roy : Contact Center Scheduling with Strict Resource Requirements. IPCO 2011 : 156-169 export record
dblp key:
conf/ipco/EisenbrandKRS11 share record
persistent URL:
Friedrich Eisenbrand , Naonori Kakimura , Thomas Rothvoß , Laura Sanità : Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011 : 170-182 share record
persistent URL:
Matteo Fischetti , Michele Monaci : Backdoor Branching. IPCO 2011 : 183-191 share record
persistent URL:
Oliver Friedmann : A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. IPCO 2011 : 192-206 share record
persistent URL:
Bissan Ghaddar , Juan C. Vera , Miguel F. Anjos : An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011 : 207-222 export record
dblp key:
conf/ipco/GiandomenicoLRS11 share record
persistent URL:
Monia Giandomenico , Adam N. Letchford , Fabrizio Rossi , Stefano Smriglio : A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011 : 223-234 share record
persistent URL:
Inge Li Gørtz , Marco Molinaro , Viswanath Nagarajan , R. Ravi : Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011 : 235-247 share record
persistent URL:
Fabrizio Grandoni , Thomas Rothvoß : Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. IPCO 2011 : 248-260 share record
persistent URL:
Stephan Held , William J. Cook , Edward C. Sewell : Safe Lower Bounds for Graph Coloring. IPCO 2011 : 261-273 share record
persistent URL:
Satoru Iwata , Mizuyo Takamatsu : Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. IPCO 2011 : 274-286 share record
persistent URL:
Volker Kaibel , Kanstantsin Pashkovich : Constructing Extended Formulations from Reflection Relations. IPCO 2011 : 287-300 share record
persistent URL:
Anna R. Karlin , Claire Mathieu , C. Thach Nguyen : Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. IPCO 2011 : 301-314 share record
persistent URL:
Tamás Király , Lap Chi Lau : Degree Bounded Forest Covering. IPCO 2011 : 315-323 share record
persistent URL:
S. Thomas McCormick , Britta Peis : A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011 : 324-335 share record
persistent URL:
Trang T. Nguyen , Mohit Tawarmalani , Jean-Philippe P. Richard : Convexification Techniques for Linear Complementarity Constraints. IPCO 2011 : 336-348 share record
persistent URL:
Ojas Parekh : Iterative Packing for Demand and Hypergraph Matching. IPCO 2011 : 349-361 share record
persistent URL:
Britta Peis , Andreas Wiese : Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO 2011 : 362-375 share record
persistent URL:
Mario Ruthmair , Günther R. Raidl : A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO 2011 : 376-388