Pages that link to "Item:Q2757571"

The following pages link to A general class of greedily solvable linear programs (Q2757571):

Displaying 23 items.

• The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
• What the transportation problem did for me (Q537598) (← links)
• Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969) (← links)
• Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
• A general model for matroids and the greedy algorithm (Q1013980) (← links)
• Series parallel composition of greedy linear programming problem (Q1321658) (← links)
• Helly-type theorems and generalized linear programming (Q1338955) (← links)
• An LP-based algorithm for the data association problem in multitarget tracking. (Q1423449) (← links)
• A note on Faigle and Kern's dual greedy polyhedra (Q1591366) (← links)
• Open shop scheduling with synchronization (Q1702656) (← links)
• A greedy algorithm for solving ordinary transportation problem with capacity constraints (Q1728270) (← links)
• Allocation under a general substitution structure (Q1737487) (← links)
• Submodular linear programs on forests (Q1919093) (← links)
• Lattice polyhedra and submodular flows (Q1926644) (← links)
• Optimal rates for estimation of two-dimensional totally positive distributions (Q2192313) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• Properties of the \(d\)-dimensional Earth mover's problem (Q2312655) (← links)
• Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
• (Q3538742) (← links)
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254) (← links)
• (Q3763862) (← links)
• Greedy Families for Linear Objective Functions (Q3970969) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)