On the role of bottleneck Monge matrices in combinatorial optimization
- 31 March 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (2) , 53-56
- https://doi.org/10.1016/0167-6377(95)00003-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An optimal algorithm for 2 × n bottleneck transportation problemsOperations Research Letters, 1991
- Efficiently solvable special cases of bottleneck travelling salesman problemsDiscrete Applied Mathematics, 1991
- On simple linear programming problemsProceedings of Symposia in Pure Mathematics, 1963
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954