The following pages link to (Q3138912):
Displaying 13 items.
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Recognition of \(d\)-dimensional Monge arrays (Q1329798) (← 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)
- Optimal couplings are totally positive and more (Q4822470) (← links)
- Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem (Q5080644) (← links)
- Inventory allocation with full downward substitution and monotone cost differences (Q6106969) (← links)