Monge sequences, antimatroids, and the transportation problem with forbidden arcs
From MaRDI portal
Publication:916563
DOI10.1016/0024-3795(90)90393-QzbMath0703.90063MaRDI QIDQ916563
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (15)
On the recognition of permuted bottleneck Monge matrices ⋮ Optimal couplings are totally positive and more ⋮ On Monge sequences in \(d\)-dimensional arrays ⋮ Robinsonian matrices: recognition challenges ⋮ Perspectives of Monge properties in optimization ⋮ Avoiding unnecessary demerging and remerging of multi‐commodity integer flows ⋮ Monge properties, discrete convexity and applications ⋮ Minimizing the number of tardy job units under release time constraints ⋮ Allocation under a general substitution structure ⋮ A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs ⋮ Reformulating linear programs with transportation constraints-With applications to workforce scheduling ⋮ Monge and feasibility sequences in general flow problems ⋮ Some of my favorite integer programming applications at IBM ⋮ A fast bipartite network flow algorithm for selective assembly ⋮ Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
Cites Work
This page was built for publication: Monge sequences, antimatroids, and the transportation problem with forbidden arcs
