Integer Programming and Combinatorial Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On the Structure of Reduced Kernel Lattice Bases
3. Altmetric Badge
   Chapter 2 All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
4. Altmetric Badge
   Chapter 3 Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
5. Altmetric Badge
   Chapter 4 Intersection Cuts for Mixed Integer Conic Quadratic Sets
6. Altmetric Badge
   Chapter 5 Content Placement via the Exponential Potential Function Method
7. Altmetric Badge
   Chapter 6 Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case
8. Altmetric Badge
   Chapter 7 Blocking Optimal Arborescences
9. Altmetric Badge
   Chapter 8 Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
10. Altmetric Badge
    Chapter 9 A Complexity and Approximability Study of the Bilevel Knapsack Problem
11. Altmetric Badge
    Chapter 10 Matroid and Knapsack Center Problems
12. Altmetric Badge
    Chapter 11 Cut-Generating Functions
13. Altmetric Badge
    Chapter 12 Reverse Chvátal-Gomory Rank
14. Altmetric Badge
    Chapter 13 On Some Generalizations of the Split Closure
15. Altmetric Badge
    Chapter 14 Packing Interdiction and Partial Covering Problems
16. Altmetric Badge
    Chapter 15 On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
17. Altmetric Badge
    Chapter 16 An Improved Integrality Gap for Asymmetric TSP Paths
18. Altmetric Badge
    Chapter 17 Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
19. Altmetric Badge
    Chapter 18 A Stochastic Probing Problem with Applications
20. Altmetric Badge
    Chapter 19 Thrifty Algorithms for Multistage Robust Optimization
21. Altmetric Badge
    Chapter 20 Shallow-Light Steiner Arborescences with Vertex Delays
22. Altmetric Badge
    Chapter 21 Two Dimensional Optimal Mechanism Design for a Sequencing Problem
23. Altmetric Badge
    Chapter 22 Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
24. Altmetric Badge
    Chapter 23 A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
25. Altmetric Badge
    Chapter 24 The Complexity of Scheduling for p-Norms of Flow and Stretch
26. Altmetric Badge
    Chapter 25 The Euclidean k-Supplier Problem
27. Altmetric Badge
    Chapter 26 Facial Structure and Representation of Integer Hulls of Convex Sets
28. Altmetric Badge
    Chapter 27 An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
29. Altmetric Badge
    Chapter 28 Chain-Constrained Spanning Trees
30. Altmetric Badge
    Chapter 29 A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
31. Altmetric Badge
    Chapter 30 0/1 Polytopes with Quadratic Chvátal Rank
32. Altmetric Badge
    Chapter 31 Eight-Fifth Approximation for the Path TSP
33. Altmetric Badge
    Chapter 32 Fast Deterministic Algorithms for Matrix Completion Problems
34. Altmetric Badge
    Chapter 33 Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines