An algorithm for the detection and construction of Monge sequences
From MaRDI portal
Publication:1116656
DOI10.1016/0024-3795(89)90487-4zbMath0666.65044OpenAlexW2045879812MaRDI QIDQ1116656
Dorit S. Hochbaum, Steven Cosares, Ron Shamir, Noga Alon
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90487-4
Numerical mathematical programming methods (65K05) 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, Optimal couplings are totally positive and more, On Monge sequences in \(d\)-dimensional arrays, Perspectives of Monge properties in optimization, Recognition of overlap graphs, Inventory allocation with full downward substitution and monotone cost differences, Monge properties, discrete convexity and applications, Monge sequences, antimatroids, and the transportation problem with forbidden arcs, Minimizing the number of tardy job units under release time constraints, Allocation under a general substitution structure, A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs, Monge and feasibility sequences in general flow problems, The \(S\)-digraph optimization problem and the greedy algorithm, Planning for End-User Substitution in Agribusiness, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, Weak Monge arrays in higher dimensions, Some recent results in the analysis of greedy algorithms for assignment problems
Cites Work
- Recognition of Gilmore-Gomory traveling salesman problem
- On Transportation Problems with Upper Bounds on Leading Rectangles
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
