Pages that link to "Item:Q685703"
From MaRDI portal
The following pages link to A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703):
Displaying 11 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs (Q916563) (← links)
- On Monge sequences in \(d\)-dimensional arrays (Q1375084) (← links)
- Allocation under a general substitution structure (Q1737487) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
- Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem (Q5080644) (← links)
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
- Inventory allocation with full downward substitution and monotone cost differences (Q6106969) (← links)
