Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 An Excluded Minor Characterization of Seymour Graphs
3. Altmetric Badge
   Chapter 2 Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
4. Altmetric Badge
   Chapter 3 A Probabilistic Analysis of the Strength of the Split and Triangle Closures
5. Altmetric Badge
   Chapter 4 Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
6. Altmetric Badge
   Chapter 5 Lift-and-Project Cuts for Mixed Integer Convex Programs
7. Altmetric Badge
   Chapter 6 TSP on Cubic and Subcubic Graphs
8. Altmetric Badge
   Chapter 7 Approximability of Capacitated Network Design
9. Altmetric Badge
   Chapter 8 Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
10. Altmetric Badge
    Chapter 9 An Exact Rational Mixed-Integer Programming Solver
11. Altmetric Badge
    Chapter 10 Valid Inequalities for the Pooling Problem with Binary Variables
12. Altmetric Badge
    Chapter 11 On the Chvátal-Gomory Closure of a Compact Convex Set
13. Altmetric Badge
    Chapter 12 Design and Verify: A New Scheme for Generating Cutting-Planes
14. Altmetric Badge
    Chapter 13 Contact Center Scheduling with Strict Resource Requirements
15. Altmetric Badge
    Chapter 14 Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
16. Altmetric Badge
    Chapter 15 Backdoor Branching
17. Altmetric Badge
    Chapter 16 A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
18. Altmetric Badge
    Chapter 17 An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
19. Altmetric Badge
    Chapter 18 A New Approach to the Stable Set Problem Based on Ellipsoids
20. Altmetric Badge
    Chapter 19 Capacitated Vehicle Routing with Non-uniform Speeds
21. Altmetric Badge
    Chapter 20 Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
22. Altmetric Badge
    Chapter 21 Safe Lower Bounds for Graph Coloring
23. Altmetric Badge
    Chapter 22 Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
24. Altmetric Badge
    Chapter 23 Constructing Extended Formulations from Reflection Relations
25. Altmetric Badge
    Chapter 24 Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
26. Altmetric Badge
    Chapter 25 Degree Bounded Forest Covering
27. Altmetric Badge
    Chapter 26 A Primal-Dual Algorithm for Weighted Abstract Cut Packing
28. Altmetric Badge
    Chapter 27 Convexification Techniques for Linear Complementarity Constraints
29. Altmetric Badge
    Chapter 28 Integer Programming and Combinatoral Optimization
30. Altmetric Badge
    Chapter 29 Universal Packet Routing with Arbitrary Bandwidths and Transit Times
31. Altmetric Badge
    Chapter 30 A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
32. Altmetric Badge
    Chapter 31 Jump Number of Two-Directional Orthogonal Ray Graphs
33. Altmetric Badge
    Chapter 32 Optimal Matching Forests and Valuated Delta-Matroids
34. Altmetric Badge
    Chapter 33 Fixed-Charge Transportation on a Path: Linear Programming Formulations