The monotonic diameter of the perfect matching and shortest path polytopes

The monotonic diameter of the perfect matching and shortest path polytopes

0.00 Avg rating0 Votes
Article ID: iaor1993595
Country: Netherlands
Volume: 12
Issue: 1
Start Page Number: 23
End Page Number: 27
Publication Date: Jul 1992
Journal: Operations Research Letters
Authors:
Keywords: programming: assignment, networks, networks: path
Abstract:

The monotonic diameter is determined for the perfect matching, assignment, and shortest path polytopes. These results show that the diameter of a polytope and its monotonic diameter may be different. Furthermore, the monotonic Hirsch conjecture is true for these polytopes.

Reviews

Required fields are marked *. Your email address will not be published.