Integer Programming and Combinatorial Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
3. Altmetric Badge
   Chapter 2 Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
4. Altmetric Badge
   Chapter 3 The Air Traffic Flow Management Problem: An Integer Optimization Approach
5. Altmetric Badge
   Chapter 4 The Induced Disjoint Paths Problem
6. Altmetric Badge
   Chapter 5 A Weighted K t , t -Free t -Factor Algorithm for Bipartite Graphs
7. Altmetric Badge
   Chapter 6 A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
8. Altmetric Badge
   Chapter 7 A Polynomial Algorithm for Weighted Abstract Flow
9. Altmetric Badge
   Chapter 8 A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
10. Altmetric Badge
    Chapter 9 Binary Positive Semidefinite Matrices and Associated Integer Polytopes
11. Altmetric Badge
    Chapter 10 Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
12. Altmetric Badge
    Chapter 11 Tight Bounds for Permutation Flow Shop Scheduling
13. Altmetric Badge
    Chapter 12 Integer Programming and Combinatorial Optimization
14. Altmetric Badge
    Chapter 13 A Polynomial Time Approximation Scheme for the Square Packing Problem
15. Altmetric Badge
    Chapter 14 Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
16. Altmetric Badge
    Chapter 15 Computing with Multi-row Gomory Cuts
17. Altmetric Badge
    Chapter 16 Constraint Orbital Branching
18. Altmetric Badge
    Chapter 17 A Fast, Simpler Algorithm for the Matroid Parity Problem
19. Altmetric Badge
    Chapter 18 Degree Bounded Matroids and Submodular Flows
20. Altmetric Badge
    Chapter 19 Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
21. Altmetric Badge
    Chapter 20 Primal-Dual Schema for Capacitated Covering Problems
22. Altmetric Badge
    Chapter 21 Offline and Online Facility Leasing
23. Altmetric Badge
    Chapter 22 Importance Sampling via Load-Balanced Facility Location
24. Altmetric Badge
    Chapter 23 A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
25. Altmetric Badge
    Chapter 24 New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
26. Altmetric Badge
    Chapter 25 Min Sum Edge Coloring in Multigraphs Via Configuration LP
27. Altmetric Badge
    Chapter 26 An Improved Algorithm for Finding Cycles Through Elements
28. Altmetric Badge
    Chapter 27 The Stable Roommates Problem with Choice Functions
29. Altmetric Badge
    Chapter 28 A New Approach to Splitting-Off
30. Altmetric Badge
    Chapter 29 Can Pure Cutting Plane Algorithms Work?
31. Altmetric Badge
    Chapter 30 The Mixing Set with Divisible Capacities
32. Altmetric Badge
    Chapter 31 A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
33. Altmetric Badge
    Chapter 32 Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles