↓ 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 Two O(log*k)-Approximation Algorithms for the Asymmetric k-Center Problem
  3. Altmetric Badge
    Chapter 2 Strongly Polynomial Algorithms for the Unsplittable Flow Problem
  4. Altmetric Badge
    Chapter 3 Edge Covers of Setpairs and the Iterative Rounding Method
  5. Altmetric Badge
    Chapter 4 The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates
  6. Altmetric Badge
    Chapter 5 Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
  7. Altmetric Badge
    Chapter 6 On the Rank of Mixed 0,1 Polyhedra
  8. Altmetric Badge
    Chapter 7 Fast 2-Variable Integer Programming
  9. Altmetric Badge
    Chapter 8 Approximating k-Spanner Problems for k > 2
  10. Altmetric Badge
    Chapter 9 A Matroid Generalization of the Stable Matching Polytope
  11. Altmetric Badge
    Chapter 10 A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
  12. Altmetric Badge
    Chapter 11 Combined Connectivity Augmentation and Orientation Problems
  13. Altmetric Badge
    Chapter 12 An Extension of a Theorem of Henneberg and Laman
  14. Altmetric Badge
    Chapter 13 Bisubmodular Function Minimization
  15. Altmetric Badge
    Chapter 14 On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem
  16. Altmetric Badge
    Chapter 15 Circuit Mengerian Directed Graphs
  17. Altmetric Badge
    Chapter 16 Integral Polyhedra Related to Even Cycle and Even Cut Matroids
  18. Altmetric Badge
    Chapter 17 A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems
  19. Altmetric Badge
    Chapter 18 Synthesis of 2-Commodity Flow Networks
  20. Altmetric Badge
    Chapter 19 Bounds for Deterministic Periodic Routing sequences
  21. Altmetric Badge
    Chapter 20 Cutting Planes for Mixed 0-1 Semidefinite Programs
  22. Altmetric Badge
    Chapter 21 Independence Free Graphs and Vertex connectivity Augmentation
  23. Altmetric Badge
    Chapter 22 The Throughput of Sequential Testing
  24. Altmetric Badge
    Chapter 23 An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
  25. Altmetric Badge
    Chapter 24 Pruning by Isomorphism in Branch-and-Cut
  26. Altmetric Badge
    Chapter 25 Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times
  27. Altmetric Badge
    Chapter 26 Fences Are Futile: On Relaxations for the Linear Ordering Problem
  28. Altmetric Badge
    Chapter 27 Generating Cuts from Multiple-Term Disjunctions
  29. Altmetric Badge
    Chapter 28 A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective
  30. Altmetric Badge
    Chapter 29 Performance Guarantees of Local Search for Multiprocessor Scheduling
  31. Altmetric Badge
    Chapter 30 connected Joins in Graphs
  32. Altmetric Badge
    Chapter 31 Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
  33. Altmetric Badge
    Chapter 32 Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Attention for Chapter 27: Generating Cuts from Multiple-Term Disjunctions
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
3 Mendeley
Summary X
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
Generating Cuts from Multiple-Term Disjunctions
Chapter number 27
Book title
Integer Programming and Combinatorial Optimization
Published by
Springer Berlin Heidelberg, June 2001
DOI 10.1007/3-540-45535-3_27
Book ISBNs
978-3-54-042225-9, 978-3-54-045535-6
Authors

Michael Perregaard, Egon Balas

Editors

Karen Aardal, Bert Gerards

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
 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 2 67%
Unspecified 1 33%
Readers by discipline Count As %
Chemical Engineering 1 33%
Unspecified 1 33%
Engineering 1 33%

This page is provided by Altmetric.