Monge and feasibility sequences in general flow problems
- 19 July 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 44 (1-3) , 21-38
- https://doi.org/10.1016/0166-218x(93)90220-i
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Monge sequences, antimatroids, and the transportation problem with forbidden arcsLinear Algebra and its Applications, 1990
- Parallel searching in generalized Monge arrays with applicationsPublished by Association for Computing Machinery (ACM) ,1990
- An algorithm for the detection and construction of Monge sequencesLinear Algebra and its Applications, 1989
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Recognition of Gilmore-Gomory traveling salesman problemDiscrete Applied Mathematics, 1986
- On Transportation Problems with Upper Bounds on Leading RectanglesSIAM Journal on Algebraic Discrete Methods, 1985
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964