↓ 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 Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
  3. Altmetric Badge
    Chapter 2 Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
  4. Altmetric Badge
    Chapter 3 Solving the Convex Cost Integer Dual Network Flow Problem
  5. Altmetric Badge
    Chapter 4 Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
  6. Altmetric Badge
    Chapter 5 Valid Inequalities for Problems with Additive Variable Upper Bounds
  7. Altmetric Badge
    Chapter 6 A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)
  8. Altmetric Badge
    Chapter 7 On the Separation of Maximally Violated mod- k Cuts
  9. Altmetric Badge
    Chapter 8 Improved Approximation Algorithms for Capacitated Facility Location Problems
  10. Altmetric Badge
    Chapter 9 Optimal 3-Terminal Cuts and Linear Programming
  11. Altmetric Badge
    Chapter 10 Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
  12. Altmetric Badge
    Chapter 11 Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
  13. Altmetric Badge
    Chapter 12 Universally Maximum Flow with Piecewise-Constant Capacities
  14. Altmetric Badge
    Chapter 13 Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
  15. Altmetric Badge
    Chapter 14 An Orientation Theorem with Parity Conditions
  16. Altmetric Badge
    Chapter 15 Parity Constrained k -Edge-Connected Orientations
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
  18. Altmetric Badge
    Chapter 17 On the Chvátal Rank of Certain Inequalities
  19. Altmetric Badge
    Chapter 18 The Square-Free 2-Factor Problem in Bipartite Graphs
  20. Altmetric Badge
    Chapter 19 The m-Cost ATSP
  21. Altmetric Badge
    Chapter 20 A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
  22. Altmetric Badge
    Chapter 21 Edge-Splitting Problems with Demands
  23. Altmetric Badge
    Chapter 22 Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors
  24. Altmetric Badge
    Chapter 23 Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)
  25. Altmetric Badge
    Chapter 24 On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
  26. Altmetric Badge
    Chapter 25 Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
  27. Altmetric Badge
    Chapter 26 Approximation Algorithms for a Directed Network Design Problem
  28. Altmetric Badge
    Chapter 27 Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)
  29. Altmetric Badge
    Chapter 28 A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
  30. Altmetric Badge
    Chapter 29 Scheduling Two Machines with Release Times
  31. Altmetric Badge
    Chapter 30 An Introduction to Empty Lattice Simplices
  32. Altmetric Badge
    Chapter 31 On Optimal Ear-Decompositions of Graphs
  33. Altmetric Badge
    Chapter 32 Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)
  34. Altmetric Badge
    Chapter 33 Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut
Attention for Chapter 32: Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
11 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
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)
Chapter number 32
Book title
Integer Programming and Combinatorial Optimization
Published in
Lecture notes in computer science, June 1999
DOI 10.1007/3-540-48777-8_32
Book ISBNs
978-3-54-066019-4, 978-3-54-048777-7
Authors

Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan, Teo, Chung-Piaw, Sethuraman, Jay, Tan, Wee-Peng

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 9%
Unknown 10 91%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 4 36%
Student > Ph. D. Student 2 18%
Researcher 1 9%
Student > Master 1 9%
Unknown 3 27%
Readers by discipline Count As %
Business, Management and Accounting 2 18%
Computer Science 2 18%
Economics, Econometrics and Finance 2 18%
Engineering 2 18%
Unknown 3 27%
Attention Score in Context

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 03 January 2014.
All research outputs
#18,359,382
of 22,738,543 outputs
Outputs from Lecture notes in computer science
#6,008
of 8,126 outputs
Outputs of similar age
#33,643
of 35,089 outputs
Outputs of similar age from Lecture notes in computer science
#5
of 6 outputs
Altmetric has tracked 22,738,543 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% 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 35,089 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 2nd percentile – i.e., 2% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 6 others from the same source and published within six weeks on either side of this one.