On Monge sequences in \(d\)-dimensional arrays

DOI10.1016/S0024-3795(97)00007-4zbMath0889.90113MaRDI QIDQ1375084

Rüdiger Rudolf

Publication date: 22 June 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmMonge sequenceHitchcock transportation problem

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Perspectives of Monge properties in optimization ⋮ Weak Monge arrays in higher dimensions

Cites Work

• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs
• An algorithm for the detection and construction of Monge sequences
• Recognition of \(d\)-dimensional Monge arrays
• A Monge property for the \(d\)-dimensional transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item