↓ 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 Identically Self-blocking Clutters
  3. Altmetric Badge
    Chapter 2 Min-Max Correlation Clustering via MultiCut
  4. Altmetric Badge
    Chapter 3 Strong Mixed-Integer Programming Formulations for Trained Neural Networks
  5. Altmetric Badge
    Chapter 4 Extended Formulations from Communication Protocols in Output-Efficient Time
  6. Altmetric Badge
    Chapter 5 Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
  7. Altmetric Badge
    Chapter 6 Intersection Cuts for Polynomial Optimization
  8. Altmetric Badge
    Chapter 7 Fixed-Order Scheduling on Parallel Machines
  9. Altmetric Badge
    Chapter 8 Online Submodular Maximization: Beating 1/2 Made Simple
  10. Altmetric Badge
    Chapter 9 Improving the Integrality Gap for Multiway Cut
  11. Altmetric Badge
    Chapter 10 $$\ell _1$$ -sparsity Approximation Bounds for Packing Integer Programs
  12. Altmetric Badge
    Chapter 11 A General Framework for Handling Commitment in Online Throughput Maximization
  13. Altmetric Badge
    Chapter 12 Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints
  14. Altmetric Badge
    Chapter 13 On Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule
  15. Altmetric Badge
    Chapter 14 Tight Approximation Ratio for Minimum Maximal Matching
  16. Altmetric Badge
    Chapter 15 Integer Programming and Incidence Treedepth
  17. Altmetric Badge
    Chapter 16 A Bundle Approach for SDPs with Exact Subgraph Constraints
  18. Altmetric Badge
    Chapter 17 Dynamic Flows with Adaptive Route Choice
  19. Altmetric Badge
    Chapter 18 The Markovian Price of Information
  20. Altmetric Badge
    Chapter 19 On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem
  21. Altmetric Badge
    Chapter 20 On Compact Representations of Voronoi Cells of Lattices
  22. Altmetric Badge
    Chapter 21 An Efficient Characterization of Submodular Spanning Tree Games
  23. Altmetric Badge
    Chapter 22 The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio
  24. Altmetric Badge
    Chapter 23 Approximate Multi-matroid Intersection via Iterative Refinement
  25. Altmetric Badge
    Chapter 24 An Exact Algorithm for Robust Influence Maximization
  26. Altmetric Badge
    Chapter 25 A New Contraction Technique with Applications to Congruency-Constrained Cuts
  27. Altmetric Badge
    Chapter 26 Sparsity of Integer Solutions in the Average Case
  28. Altmetric Badge
    Chapter 27 A Generic Exact Solver for Vehicle Routing and Related Problems
  29. Altmetric Badge
    Chapter 28 Earliest Arrival Transshipments in Networks with Multiple Sinks
  30. Altmetric Badge
    Chapter 29 Intersection Cuts for Factorable MINLP
  31. Altmetric Badge
    Chapter 30 Linear Programming Using Limited-Precision Oracles
  32. Altmetric Badge
    Chapter 31 Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
  33. Altmetric Badge
    Chapter 32 Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling
  34. Altmetric Badge
    Chapter 33 Random Projections for Quadratic Programs over a Euclidean Ball
Attention for Chapter 15: Integer Programming and Incidence Treedepth
Altmetric Badge

Mentioned by

2 Wikipedia pages


2 Dimensions

Readers on

9 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.
Chapter title
Integer Programming and Incidence Treedepth
Chapter number 15
Book title
Integer Programming and Combinatorial Optimization
Published by
Springer, Cham, May 2019
DOI 10.1007/978-3-030-17953-3_15
Book ISBNs
978-3-03-017952-6, 978-3-03-017953-3

Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk, Marcin Wrochna, Eiben, Eduard, Ganian, Robert, Knop, Dušan, Ordyniak, Sebastian, Pilipczuk, Michał, Wrochna, Marcin

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Other 2 22%
Student > Ph. D. Student 1 11%
Researcher 1 11%
Student > Bachelor 1 11%
Unknown 4 44%
Readers by discipline Count As %
Computer Science 4 44%
Immunology and Microbiology 1 11%
Unknown 4 44%