A General Class of Greedily Solvable Linear Programs

DOI10.1287/moor.23.4.892zbMath0977.90045OpenAlexW2014383099MaRDI QIDQ2757571

Frits C. R. Spieksma, Fabio Tardella, Maurice Queyranne

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.4.892

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Related Items

Dual greedy polyhedra, choice functions, and abstract convex geometries, The assignment problem with nearly Monge arrays and incompatible partner indices, Lattice polyhedra and submodular flows, Optimal rates for estimation of two-dimensional totally positive distributions, Open shop scheduling with synchronization, Estimation of Monge matrices, An LP-based algorithm for the data association problem in multitarget tracking., A greedy algorithm for solving ordinary transportation problem with capacity constraints, Allocation under a general substitution structure, Note on pseudolattices, lattices and submodular linear programs, What the transportation problem did for me, A general model for matroids and the greedy algorithm, Properties of the \(d\)-dimensional Earth mover's problem, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem