The d-step conjecture and its relatives
Mathematics of Operations Research
An O(n) bound for the diameter of transshipment polytopes
Operations Research Letters
The monotonic diameter of traveling salesman polytopes
Operations Research Letters
Hi-index | 0.00 |
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.