↓ Skip to main content
What is this page? Embed badge

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 Solving LP Relaxations of Large-Scale Precedence Constrained Problems
  3. Altmetric Badge
    Chapter 2 Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
  4. Altmetric Badge
    Chapter 3 Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
  5. Altmetric Badge
    Chapter 4 Restricted b -Matchings in Degree-Bounded Graphs
  6. Altmetric Badge
    Chapter 5 Zero-Coefficient Cuts
  7. Altmetric Badge
    Chapter 6 Prize-Collecting Steiner Network Problems
  8. Altmetric Badge
    Chapter 7 On Lifting Integer Variables in Minimal Inequalities
  9. Altmetric Badge
    Chapter 8 Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
  10. Altmetric Badge
    Chapter 9 On Generalizations of Network Design Problems with Degree Bounds
  11. Altmetric Badge
    Chapter 10 A Polyhedral Study of the Mixed Integer Cut
  12. Altmetric Badge
    Chapter 11 Symmetry Matters for the Sizes of Extended Formulations
  13. Altmetric Badge
    Chapter 12 A 3-Approximation for Facility Location with Uniform Capacities
  14. Altmetric Badge
    Chapter 13 Secretary Problems via Linear Programming
  15. Altmetric Badge
    Chapter 14 Branched Polyhedral Systems
  16. Altmetric Badge
    Chapter 15 Hitting Diamonds and Growing Cacti
  17. Altmetric Badge
    Chapter 16 Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
  18. Altmetric Badge
    Chapter 17 A Polynomial-Time Algorithm for Optimizing over N -Fold 4-Block Decomposable Integer Programs
  19. Altmetric Badge
    Chapter 18 Universal Sequencing on a Single Machine
  20. Altmetric Badge
    Chapter 19 Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
  21. Altmetric Badge
    Chapter 20 Integer Quadratic Quasi-polyhedra
  22. Altmetric Badge
    Chapter 21 An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
  23. Altmetric Badge
    Chapter 22 An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
  24. Altmetric Badge
    Chapter 23 Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
  25. Altmetric Badge
    Chapter 24 The Price of Collusion in Series-Parallel Networks
  26. Altmetric Badge
    Chapter 25 The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
  27. Altmetric Badge
    Chapter 26 A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
  28. Altmetric Badge
    Chapter 27 On Column-Restricted and Priority Covering Integer Programs
  29. Altmetric Badge
    Chapter 28 On k -Column Sparse Packing Programs
  30. Altmetric Badge
    Chapter 29 Hypergraphic LP Relaxations for Steiner Trees
  31. Altmetric Badge
    Chapter 30 Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
  32. Altmetric Badge
    Chapter 31 Efficient Algorithms for Average Completion Time Scheduling
  33. Altmetric Badge
    Chapter 32 Experiments with Two Row Tableau Cuts
  34. Altmetric Badge
    Chapter 33 An OPT  + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
  35. Altmetric Badge
    Chapter 34 On the Rank of Cutting-Plane Proof Systems
Attention for Chapter 16: Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
3 Mendeley
Summary Dimensions citations
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
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
Chapter number 16
Book title
Integer Programming and Combinatorial Optimization
Published in
ADS, June 2010
DOI 10.1007/978-3-642-13036-6_16
Book ISBNs
978-3-64-213035-9, 978-3-64-213036-6
Authors

Andreas Bley, Jose Neto, Bley, Andreas, Neto, Jose

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 33%
Professor > Associate Professor 1 33%
Lecturer 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Computer Science 1 33%
Agricultural and Biological Sciences 1 33%

This page is provided by Altmetric.