A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
From MaRDI portal
(Redirected from Publication:685703)
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
- scientific article; zbMATH DE number 432782 (Why is no real title available?)
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- A Monge property for the \(d\)-dimensional transportation problem
- An algorithm for the detection and construction of Monge sequences
- Minimizing the number of tardy job units under release time constraints
- Monge and feasibility sequences in general flow problems
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- On the Monge property of matrices
- Recognition of Gilmore-Gomory traveling salesman problem
- Recognition of \(d\)-dimensional Monge arrays
Cited in
(12)- An algorithm for the detection and construction of Monge sequences
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
- On the recognition of permuted bottleneck Monge matrices
- On Monge sequences in \(d\)-dimensional arrays
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Inventory allocation with full downward substitution and monotone cost differences
- Allocation under a general substitution structure
- Perspectives of Monge properties in optimization
- Monge properties, discrete convexity and applications
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Technical note -- A Monge sequence-based approach to characterize the competitive newsvendor problem
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)
