A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
From MaRDI portal
Publication:685703
DOI10.1016/0012-365X(93)90382-4zbMATH Open0799.90093MaRDI QIDQ685703FDOQ685703
Authors: Ron Shamir 
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Fast transport optimization for Monge costs on the circle
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Faster algorithms for the geometric transportation problem
- An algorithm for semi-infinite transportation problems
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- scientific article; zbMATH DE number 5595241
- Algorithms for the transportation problem in geometric settings
- A strongly polynomial algorithm for the transportation problem
Cites Work
- Minimizing the number of tardy job units under release time constraints
- Recognition of \(d\)-dimensional Monge arrays
- A Monge property for the \(d\)-dimensional transportation problem
- Recognition of Gilmore-Gomory traveling salesman problem
- Title not available (Why is that?)
- An algorithm for the detection and construction of Monge sequences
- Title not available (Why is that?)
- On the Monge property of matrices
- Title not available (Why is that?)
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Monge and feasibility sequences in general flow problems
Cited In (12)
- Monge properties, discrete convexity and applications
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- On Monge sequences in \(d\)-dimensional arrays
- An algorithm for the detection and construction of Monge sequences
- Technical note -- A Monge sequence-based approach to characterize the competitive newsvendor problem
- Allocation under a general substitution structure
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Perspectives of Monge properties in optimization
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- Inventory allocation with full downward substitution and monotone cost differences
- On the recognition of permuted bottleneck Monge matrices
This page was built for publication: A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685703)
