↓ 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 The Two-Point Fano and Ideal Binary Clutters
  3. Altmetric Badge
    Chapter 2 On Scheduling Coflows
  4. Altmetric Badge
    Chapter 3 Integrality Gaps of Integer Knapsack Problems
  5. Altmetric Badge
    Chapter 4 An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut
  6. Altmetric Badge
    Chapter 5 Approximation of Corner Polyhedra with Families of Intersection Cuts
  7. Altmetric Badge
    Chapter 6 The Structure of the Infinite Models in Integer Programming
  8. Altmetric Badge
    Chapter 7 Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination
  9. Altmetric Badge
    Chapter 8 Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
  10. Altmetric Badge
    Chapter 9 Cutting Planes from Wide Split Disjunctions
  11. Altmetric Badge
    Chapter 10 The Saleman’s Improved Tours for Fundamental Classes
  12. Altmetric Badge
    Chapter 11 The Heterogeneous Capacitated k-Center Problem
  13. Altmetric Badge
    Chapter 12 Local Guarantees in Graph Cuts and Clustering
  14. Altmetric Badge
    Chapter 13 Verifying Integer Programming Results
  15. Altmetric Badge
    Chapter 14 Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
  16. Altmetric Badge
    Chapter 15 A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem
  17. Altmetric Badge
    Chapter 16 Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
  18. Altmetric Badge
    Chapter 17 Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
  19. Altmetric Badge
    Chapter 18 Discrete Newton’s Algorithm for Parametric Submodular Function Minimization
  20. Altmetric Badge
    Chapter 19 Stochastic Online Scheduling on Unrelated Machines
  21. Altmetric Badge
    Chapter 20 Online Matroid Intersection: Beating Half for Random Arrival
  22. Altmetric Badge
    Chapter 21 Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector
  23. Altmetric Badge
    Chapter 22 An Improved Deterministic Rescaling for Linear Programming Algorithms
  24. Altmetric Badge
    Chapter 23 Min-Max Theorems for Packing and Covering Odd (u, v)-trails
  25. Altmetric Badge
    Chapter 24 Breaking $$1 - 1/e$$ Barrier for Non-preemptive Throughput Maximization
  26. Altmetric Badge
    Chapter 25 A Quasi-Polynomial Approximation for the Restricted Assignment Problem
  27. Altmetric Badge
    Chapter 26 Adaptive Submodular Ranking
  28. Altmetric Badge
    Chapter 27 On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory–Johnson Infinite Group Problem
  29. Altmetric Badge
    Chapter 28 Minimum Birkhoff-von Neumann Decomposition
  30. Altmetric Badge
    Chapter 29 Maximum Matching in the Online Batch-Arrival Model
  31. Altmetric Badge
    Chapter 30 Budget Feasible Mechanisms on Matroids
  32. Altmetric Badge
    Chapter 31 Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
  33. Altmetric Badge
    Chapter 32 Mixed-Integer Convex Representability
  34. Altmetric Badge
    Chapter 33 High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts
  35. Altmetric Badge
    Chapter 34 Enumeration of Integer Points in Projections of Unbounded Polyhedra
  36. Altmetric Badge
    Chapter 35 Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings
  37. Altmetric Badge
    Chapter 36 Equilibrium Computation in Atomic Splittable Singleton Congestion Games
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

5 tweeters
1 Google+ user


1 Dimensions

Readers on

182 Mendeley
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.
Integer Programming and Combinatorial Optimization
Published by
Springer, Cham, January 2017
DOI 10.1007/978-3-319-59250-3
978-3-31-959249-7, 978-3-31-959250-3

Friedrich Eisenbrand, Jochen Koenemann

Twitter Demographics

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

Mendeley readers

The data shown below were compiled from readership statistics for 182 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 4 2%
United Kingdom 3 2%
Brazil 2 1%
Belgium 1 <1%
China 1 <1%
Norway 1 <1%
Morocco 1 <1%
Italy 1 <1%
Latvia 1 <1%
Other 6 3%
Unknown 161 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 65 36%
Student > Master 29 16%
Researcher 27 15%
Student > Bachelor 12 7%
Student > Doctoral Student 9 5%
Other 40 22%
Readers by discipline Count As %
Engineering 50 27%
Computer Science 49 27%
Business, Management and Accounting 20 11%
Mathematics 20 11%
Unspecified 13 7%
Other 30 16%