A fast algorithm for constructing monge sequences in transportation problems with forbidden arcs
- 1 April 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 114 (1-3) , 435-444
- https://doi.org/10.1016/0012-365x(93)90382-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Monge and feasibility sequences in general flow problemsDiscrete Applied Mathematics, 1993
- Greedily Solvable Transportation Networks and Edge-Guided Vertex EliminationSeries on Applied Mathematics, 1993
- Monge sequences, antimatroids, and the transportation problem with forbidden arcsLinear Algebra and its Applications, 1990
- Minimizing the number of tardy job units under release time constraintsDiscrete Applied Mathematics, 1990
- On the monge property of matricesDiscrete Mathematics, 1990
- An algorithm for the detection and construction of Monge sequencesLinear Algebra and its Applications, 1989
- Recognition of Gilmore-Gomory traveling salesman problemDiscrete Applied Mathematics, 1986