Monge sequences, antimatroids, and the transportation problem with forbidden arcs
From MaRDI portal
DOI10.1016/0024-3795(90)90393-QzbMATH Open0703.90063MaRDI QIDQ916563FDOQ916563
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Monge and feasibility sequences in general flow problems
- Monge sequences and a simple assignment algorithm
- An algorithm for the detection and construction of Monge sequences
- On Monge sequences in \(d\)-dimensional arrays
Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- An algorithm for the detection and construction of Monge sequences
- Title not available (Why is that?)
- A circuit set characterization of antimatroids
- Title not available (Why is that?)
- Matroids and antimatroids - a survey
Cited In (16)
- Monge and feasibility sequences in general flow problems
- Monge properties, discrete convexity and applications
- Robinsonian matrices: recognition challenges
- Some of my favorite integer programming applications at IBM
- On a transport problem and monoids of non-negative integers
- On Monge sequences in \(d\)-dimensional arrays
- A fast bipartite network flow algorithm for selective assembly
- Optimal couplings are totally positive and more
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
- Allocation under a general substitution structure
- Minimizing the number of tardy job units under release time constraints
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Perspectives of Monge properties in optimization
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
- On the recognition of permuted bottleneck Monge matrices
This page was built for publication: Monge sequences, antimatroids, and the transportation problem with forbidden arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916563)
