Pages that link to "Item:Q2757571"

The following pages link to A General Class of Greedily Solvable Linear Programs (Q2757571):

Displaying 14 items.

• The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
• What the transportation problem did for me (Q537598) (← links)
• Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
• A general model for matroids and the greedy algorithm (Q1013980) (← links)
• An LP-based algorithm for the data association problem in multitarget tracking. (Q1423449) (← 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)
• 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)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)