Perspectives of Monge properties in optimization
- 1 September 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 70 (2) , 95-161
- https://doi.org/10.1016/0166-218x(95)00103-x
Abstract
No abstract availableKeywords
This publication has 98 references indexed in Scilit:
- On the recognition of permuted bottleneck Monge matricesDiscrete Applied Mathematics, 1995
- Permuting matrices to avoid forbidden submatricesDiscrete Applied Mathematics, 1995
- On the role of bottleneck Monge matrices in combinatorial optimizationOperations Research Letters, 1995
- Some recent results in the analysis of greedy algorithms for assignment problemsOR Spectrum, 1994
- Extending the quadrangle inequality to speed-up dynamic programmingInformation Processing Letters, 1994
- An optimal algorithm for 2 × n bottleneck transportation problemsOperations Research Letters, 1991
- Reshipments and overshipments in transportation problems with minimax objectiveOR Spectrum, 1991
- Monge sequences and a simple assignment algorithmDiscrete Applied Mathematics, 1986
- Certain classes of traveling-salesman problemsCybernetics and Systems Analysis, 1979
- Two special cases of the assignment problemDiscrete Mathematics, 1975