Back to search
Characterization and algorithms for greedily solvable transportation problems
Data up to Jan 2025
Published1990
Citations21
References4
Total Citations Per Year
Abstract
References (4)
A faster strongly polynomial minimum cost flow algorithm
1988 • 199 citations
Minimizing the number of tardy job units under release time constraints
1990 • 47 citations
An algorithm for the detection and construction of Monge sequences
1989 • 34 citations
Monge sequences, antimatroids, and the transportation problem with forbidden arcs
1990 • 22 citations
Cited By (0)
Loading...