↓ Skip to main content

Integer Programming and Combinatorial Optimization

Overview of attention for book
Cover of 'Integer Programming and Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Idealness of k -wise Intersecting Families
  3. Altmetric Badge
    Chapter 2 Flexible Graph Connectivity
  4. Altmetric Badge
    Chapter 3 Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
  5. Altmetric Badge
    Chapter 4 Optimizing Sparsity over Lattices and Semigroups
  6. Altmetric Badge
    Chapter 5 A Technique for Obtaining True Approximations for k -Center with Covering Constraints
  7. Altmetric Badge
    Chapter 6 Tight Approximation Bounds for Maximum Multi-coverage
  8. Altmetric Badge
    Chapter 7 Implementing Automatic Benders Decomposition in a Modern MIP Solver
  9. Altmetric Badge
    Chapter 8 Improved Approximation Algorithms for Inventory Problems
  10. Altmetric Badge
    Chapter 9 Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
  11. Altmetric Badge
    Chapter 10 On a Generalization of the Chvátal-Gomory Closure
  12. Altmetric Badge
    Chapter 11 Algorithms for Flows over Time with Scheduling Costs
  13. Altmetric Badge
    Chapter 12 Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation
  14. Altmetric Badge
    Chapter 13 Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)
  15. Altmetric Badge
    Chapter 14 Continuous Facility Location on Graphs
  16. Altmetric Badge
    Chapter 15 Recognizing Even-Cycle and Even-Cut Matroids
  17. Altmetric Badge
    Chapter 16 A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2  $$\times $$  2 Submatrices
  18. Altmetric Badge
    Chapter 17 Fair Colorful k -Center Clustering
  19. Altmetric Badge
    Chapter 18 Popular Branchings and Their Dual Certificates
  20. Altmetric Badge
    Chapter 19 Sparse Graphs and an Augmentation Problem
  21. Altmetric Badge
    Chapter 20 About the Complexity of Two-Stage Stochastic IPs
  22. Altmetric Badge
    Chapter 21 Packing Under Convex Quadratic Constraints
  23. Altmetric Badge
    Chapter 22 Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles
  24. Altmetric Badge
    Chapter 23 Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds
  25. Altmetric Badge
    Chapter 24 Maximal Quadratic-Free Sets
  26. Altmetric Badge
    Chapter 25 On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
  27. Altmetric Badge
    Chapter 26 The Integrality Number of an Integer Program
  28. Altmetric Badge
    Chapter 27 Persistency of Linear Programming Relaxations for the Stable Set Problem
  29. Altmetric Badge
    Chapter 28 Constructing Lattice-Free Gradient Polyhedra in Dimension Two
  30. Altmetric Badge
    Chapter 29 Sequence Independent Lifting for the Set of Submodular Maximization Problem
  31. Altmetric Badge
    Chapter 30 A Fast $$(2 + 2/7)$$ -Approximation Algorithm for Capacitated Cycle Covering
  32. Altmetric Badge
    Chapter 31 Graph Coloring Lower Bounds from Decision Diagrams
  33. Altmetric Badge
    Chapter 32 On Convex Hulls of Epigraphs of QCQPs
  34. Altmetric Badge
    Chapter 33 On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
3 X users
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Integer Programming and Combinatorial Optimization
Published by
Springer International Publishing, June 2020
DOI 10.1007/978-3-030-45771-6
ISBNs
978-3-03-045770-9, 978-3-03-045771-6
Editors

Bienstock, Daniel, Zambelli, Giacomo

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.