A Monge property for the \(d\)-dimensional transportation problem
From MaRDI portal
Publication:1805449
DOI10.1016/0166-218X(93)E0121-EzbMath0833.90083OpenAlexW1991863159WikidataQ127633790 ScholiaQ127633790MaRDI QIDQ1805449
Wolfgang W. Bein, Pramod K. Pathak, James K. Park, Peter Brucker
Publication date: 18 March 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0121-e
Monge propertyHitchcock problemnorthwest corner rule\(d\)-dimensional transportation problemmonotone arrays
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Recognition of \(d\)-dimensional Monge arrays, Permuting matrices to avoid forbidden submatrices, On the recognition of permuted bottleneck Monge matrices, The assignment problem with nearly Monge arrays and incompatible partner indices, Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon, On Monge sequences in \(d\)-dimensional arrays, Three-dimensional axial assignment problems with decomposable cost coefficients, Submodular linear programs on forests, Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems, Perspectives of Monge properties in optimization, Comparing weighted difference and Earth mover's distance via Young diagrams, A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case, Monge properties, discrete convexity and applications, Open shop scheduling with synchronization, Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems, A greedy algorithm for solving ordinary transportation problem with capacity constraints, Dynamic discrete tomography, A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs, On a property of a three-dimensional matrix, Properties of the \(d\)-dimensional Earth mover's problem, Geometric three-dimensional assignment problems, A generalization for the expected value of the earth mover's distance, The nucleon of cooperative games and an algorithm for matching games, Weak Monge arrays in higher dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Monge property of matrices
- Geometric applications of a matrix-searching algorithm
- Series parallel composition of greedy linear programming problem
- On a Class of Capacitated Transportation Problems
- Improved Algorithms for Economic Lot Size Problems
- A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS
- On-line dynamic programming with applications to the prediction of RNA secondary structure
