scientific article; zbMATH DE number 432782

MaRDI QIDQ3138912zbMATH OpenFDO

Authors Ron Shamir, Brenda L. Dietrich

Publication date 2 January 1994

zbMATH Keywords

transportation problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06)

Cited in

(13)

• On the recognition of permuted bottleneck Monge matrices
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• On Monge sequences in \(d\)-dimensional arrays
• Monge and feasibility sequences in general flow problems
• Recognition of \(d\)-dimensional Monge arrays
• Inventory allocation with full downward substitution and monotone cost differences
• Allocation under a general substitution structure
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Some of my favorite integer programming applications at IBM
• Technical note -- A Monge sequence-based approach to characterize the competitive newsvendor problem
• A fast bipartite network flow algorithm for selective assembly
• Optimal couplings are totally positive and more

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138912)