↓ 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 37 Improved approximation algorithms for MAX k -CUT and MAX BISECTION
  3. Altmetric Badge
    Chapter 38 Approximating minimum feedback sets and multi-cuts in directed graphs
  4. Altmetric Badge
    Chapter 39 Nonlinear formulations and improved randomized approximation algorithms for multicut problems
  5. Altmetric Badge
    Chapter 40 Separating clique tree and bipartition inequalities in polynomial time
  6. Altmetric Badge
    Chapter 41 The interval order polytope of a digraph
  7. Altmetric Badge
    Chapter 42 Separation problems for the stable set polytope
  8. Altmetric Badge
    Chapter 43 Computational study of a family of mixed-integer quadratic programming problems
  9. Altmetric Badge
    Chapter 44 A minimal algorithm for the Bounded Knapsack Problem
  10. Altmetric Badge
    Chapter 45 A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
  11. Altmetric Badge
    Chapter 46 Combining semidefinite and polyhedral relaxations for integer programs
  12. Altmetric Badge
    Chapter 47 Distributed near-optimal matching
  13. Altmetric Badge
    Chapter 48 The random linear bottleneck assignment problem
  14. Altmetric Badge
    Chapter 49 On implementing push-relabel method for the maximum flow problem
  15. Altmetric Badge
    Chapter 50 Use of hidden network structure in the set partitioning problem
  16. Altmetric Badge
    Chapter 51 Generalized max flows and augmenting paths
  17. Altmetric Badge
    Chapter 52 Oriented matroid polytopes and polyhedral fans are signable
  18. Altmetric Badge
    Chapter 53 On combinatorial properties of binary spaces
  19. Altmetric Badge
    Chapter 54 Coverings and delta-coverings
  20. Altmetric Badge
    Chapter 55 The topological structure of maximal lattice free convex bodies: The general case
  21. Altmetric Badge
    Chapter 56 The Hilbert basis of the cut cone over the complete graph K 6
  22. Altmetric Badge
    Chapter 57 GRIN: An implementation of Gröbner bases for integer programming
  23. Altmetric Badge
    Chapter 58 Scheduling jobs of equal length: Complexity, facets and computational results
  24. Altmetric Badge
    Chapter 59 Formulating a scheduling problem with almost identical jobs by using positional completion times
  25. Altmetric Badge
    Chapter 60 Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
  26. Altmetric Badge
    Chapter 61 A mickey-mouse decomposition theorem
  27. Altmetric Badge
    Chapter 62 Minimum cost dynamic flows: The series-parallel case
  28. Altmetric Badge
    Chapter 63 (0, ±1) ideal matrices
  29. Altmetric Badge
    Chapter 64 Embedding graphs in the torus in linear time
  30. Altmetric Badge
    Chapter 65 A characterization of Seymour graphs
  31. Altmetric Badge
    Chapter 66 The Markov chain of colourings
  32. Altmetric Badge
    Chapter 67 Packing algorithms for arborescences (and spanning trees) in capacitated graphs
  33. Altmetric Badge
    Chapter 68 A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
  34. Altmetric Badge
    Chapter 69 How to make a strongly connected digraph two-connected
  35. Altmetric Badge
    Chapter 70 Polyhedra and optimization in connection with a weak majorization ordering
  36. Altmetric Badge
    Chapter 71 Combining and strengthening Gomory cuts
  37. Altmetric Badge
    Chapter 72 Sequence independent lifting of cover inequalities
Attention for Chapter 49: On implementing push-relabel method for the maximum flow problem
Altmetric Badge

About this Attention Score

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

Mentioned by

1 Wikipedia page

Readers on

44 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
On implementing push-relabel method for the maximum flow problem
Chapter number 49
Book title
Integer Programming and Combinatorial Optimization
Published in
Lecture notes in computer science, May 1995
DOI 10.1007/3-540-59408-6_49
Book ISBNs
978-3-54-059408-6, 978-3-54-049245-0

Boris V. Cherkassky, Andrew V. Goldberg

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
France 1 2%
Italy 1 2%
Austria 1 2%
India 1 2%
Spain 1 2%
United States 1 2%
Unknown 38 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 16 36%
Researcher 5 11%
Professor > Associate Professor 4 9%
Student > Master 4 9%
Student > Postgraduate 3 7%
Other 6 14%
Unknown 6 14%
Readers by discipline Count As %
Computer Science 26 59%
Engineering 6 14%
Business, Management and Accounting 3 7%
Physics and Astronomy 2 5%
Environmental Science 1 2%
Other 1 2%
Unknown 5 11%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 12 April 2014.
All research outputs
of 22,786,087 outputs
Outputs from Lecture notes in computer science
of 8,125 outputs
Outputs of similar age
of 24,922 outputs
Outputs of similar age from Lecture notes in computer science
of 7 outputs
Altmetric has tracked 22,786,087 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% of its peers.
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 24,922 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 7 others from the same source and published within six weeks on either side of this one. This one has scored higher than 5 of them.