↓ Skip to main content

Integer Programming and Combinatoral Optimization

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 An Excluded Minor Characterization of Seymour Graphs
  3. Altmetric Badge
    Chapter 2 Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
  4. Altmetric Badge
    Chapter 3 A Probabilistic Analysis of the Strength of the Split and Triangle Closures
  5. Altmetric Badge
    Chapter 4 Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
  6. Altmetric Badge
    Chapter 5 Lift-and-Project Cuts for Mixed Integer Convex Programs
  7. Altmetric Badge
    Chapter 6 TSP on Cubic and Subcubic Graphs
  8. Altmetric Badge
    Chapter 7 Approximability of Capacitated Network Design
  9. Altmetric Badge
    Chapter 8 Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
  10. Altmetric Badge
    Chapter 9 An Exact Rational Mixed-Integer Programming Solver
  11. Altmetric Badge
    Chapter 10 Valid Inequalities for the Pooling Problem with Binary Variables
  12. Altmetric Badge
    Chapter 11 On the Chvátal-Gomory Closure of a Compact Convex Set
  13. Altmetric Badge
    Chapter 12 Design and Verify: A New Scheme for Generating Cutting-Planes
  14. Altmetric Badge
    Chapter 13 Contact Center Scheduling with Strict Resource Requirements
  15. Altmetric Badge
    Chapter 14 Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
  16. Altmetric Badge
    Chapter 15 Backdoor Branching
  17. Altmetric Badge
    Chapter 16 A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
  18. Altmetric Badge
    Chapter 17 An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
  19. Altmetric Badge
    Chapter 18 A New Approach to the Stable Set Problem Based on Ellipsoids
  20. Altmetric Badge
    Chapter 19 Capacitated Vehicle Routing with Non-uniform Speeds
  21. Altmetric Badge
    Chapter 20 Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
  22. Altmetric Badge
    Chapter 21 Safe Lower Bounds for Graph Coloring
  23. Altmetric Badge
    Chapter 22 Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
  24. Altmetric Badge
    Chapter 23 Constructing Extended Formulations from Reflection Relations
  25. Altmetric Badge
    Chapter 24 Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
  26. Altmetric Badge
    Chapter 25 Degree Bounded Forest Covering
  27. Altmetric Badge
    Chapter 26 A Primal-Dual Algorithm for Weighted Abstract Cut Packing
  28. Altmetric Badge
    Chapter 27 Convexification Techniques for Linear Complementarity Constraints
  29. Altmetric Badge
    Chapter 28 Integer Programming and Combinatoral Optimization
  30. Altmetric Badge
    Chapter 29 Universal Packet Routing with Arbitrary Bandwidths and Transit Times
  31. Altmetric Badge
    Chapter 30 A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
  32. Altmetric Badge
    Chapter 31 Jump Number of Two-Directional Orthogonal Ray Graphs
  33. Altmetric Badge
    Chapter 32 Optimal Matching Forests and Valuated Delta-Matroids
  34. Altmetric Badge
    Chapter 33 Fixed-Charge Transportation on a Path: Linear Programming Formulations
Attention for Chapter 28: Integer Programming and Combinatoral Optimization
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
3 tweeters

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
8 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 Combinatoral Optimization
Chapter number 28
Book title
Integer Programming and Combinatoral Optimization
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-20807-2_28
Book ISBNs
978-3-64-220806-5, 978-3-64-220807-2
Authors

Ojas Parekh

Twitter Demographics

The data shown below were collected from the profiles of 3 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 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Japan 1 13%
United States 1 13%
Unknown 6 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 38%
Student > Postgraduate 1 13%
Student > Bachelor 1 13%
Lecturer 1 13%
Researcher 1 13%
Other 1 13%
Readers by discipline Count As %
Computer Science 4 50%
Agricultural and Biological Sciences 1 13%
Mathematics 1 13%
Physics and Astronomy 1 13%
Engineering 1 13%
Other 0 0%

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 04 April 2016.
All research outputs
#7,147,008
of 9,701,930 outputs
Outputs from Lecture notes in computer science
#5,278
of 7,103 outputs
Outputs of similar age
#183,366
of 281,960 outputs
Outputs of similar age from Lecture notes in computer science
#34
of 62 outputs
Altmetric has tracked 9,701,930 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 7,103 research outputs from this source. They receive a mean Attention Score of 4.3. This one is in the 24th percentile – i.e., 24% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 281,960 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 29th percentile – i.e., 29% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 62 others from the same source and published within six weeks on either side of this one. This one is in the 40th percentile – i.e., 40% of its contemporaries scored the same or lower than it.