|
An Excluded Minor Characterization of Seymour Graphs |
|
|
1 | (13) |
|
|
|
|
|
|
|
|
|
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes |
|
|
14 | (13) |
|
|
|
|
|
A Probabilistic Analysis of the Strength of the Split and Triangle Closures |
|
|
27 | (12) |
|
|
|
|
|
|
|
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation |
|
|
39 | (13) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Lift-and-Project Cuts for Mixed Integer Convex Programs |
|
|
52 | (13) |
|
|
|
TSP on Cubic and Subcubic Graphs |
|
|
65 | (13) |
|
|
|
|
|
|
|
|
|
Approximability of Capacitated Network Design |
|
|
78 | (14) |
|
|
|
|
|
|
|
|
|
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems |
|
|
92 | (12) |
|
|
|
|
|
An Exact Rational Mixed-Integer Programming Solver |
|
|
104 | (13) |
|
|
|
|
|
|
|
|
|
Valid Inequalities for the Pooling Problem with Binary Variables |
|
|
117 | (13) |
|
|
|
|
|
|
|
On the Chvatal-Gomory Closure of a Compact Convex Set |
|
|
130 | (13) |
|
|
|
|
|
|
|
Design and Verify: A New Scheme for Generating Cutting-Planes |
|
|
143 | (13) |
|
|
|
|
|
Contact Center Scheduling with Strict Resource Requirements |
|
|
156 | (14) |
|
|
|
|
|
|
|
|
|
|
|
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps |
|
|
170 | (13) |
|
|
|
|
|
|
|
|
|
|
|
183 | (9) |
|
|
|
|
|
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games |
|
|
192 | (15) |
|
|
|
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming |
|
|
207 | (16) |
|
|
|
|
|
|
|
A New Approach to the Stable Set Problem Based on Ellipsoids |
|
|
223 | (12) |
|
|
|
|
|
|
|
|
|
Capacitated Vehicle Routing with Non-uniform Speeds |
|
|
235 | (13) |
|
|
|
|
|
|
|
|
|
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location |
|
|
248 | (13) |
|
|
|
|
|
Safe Lower Bounds For Graph Coloring |
|
|
261 | (13) |
|
|
|
|
|
|
|
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation |
|
|
274 | (13) |
|
|
|
|
|
Constructing Extended Formulations from Reflection Relations |
|
|
287 | (14) |
|
|
|
|
|
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack |
|
|
301 | (14) |
|
|
|
|
|
|
|
Degree Bounded Forest Covering |
|
|
315 | (9) |
|
|
|
|
|
A Primal-Dual Algorithm for Weighted Abstract Cut Packing |
|
|
324 | (12) |
|
|
|
|
|
Convexification Techniques for Linear Complementarity Constraints |
|
|
336 | (13) |
|
|
|
|
|
|
|
Iterative Packing for Demand and Hypergraph Matching |
|
|
349 | (13) |
|
|
|
Universal Packet Routing with Arbitrary Bandwidths and Transit Times |
|
|
362 | (14) |
|
|
|
|
|
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems |
|
|
376 | (13) |
|
|
|
|
|
Jump Number of Two-Directional Orthogonal Ray Graphs |
|
|
389 | (15) |
|
|
|
|
|
Optimal Matching Forests and Valuated Delta-Matroids |
|
|
404 | (13) |
|
|
|
Fixed-Charge Transportation on a Path: Linear Programming Formulations |
|
|
417 | (14) |
|
|
| Author Index |
|
431 | |
