scientific article; zbMATH DE number 432782
From MaRDI portal
Publication:3138912
zbMATH Open0800.68479MaRDI QIDQ3138912FDOQ3138912
Authors: Ron Shamir, Brenda L. Dietrich 
Publication date: 2 January 1994
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06)
Cited In (13)
- Monge and feasibility sequences in general flow problems
- Monge properties, discrete convexity and applications
- Some of my favorite integer programming applications at IBM
- On Monge sequences in \(d\)-dimensional arrays
- A fast bipartite network flow algorithm for selective assembly
- Optimal couplings are totally positive and more
- Allocation under a general substitution structure
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Perspectives of Monge properties in optimization
- Recognition of \(d\)-dimensional Monge arrays
- Inventory allocation with full downward substitution and monotone cost differences
- On the recognition of permuted bottleneck Monge matrices
- Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem
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)
