Monge sequences, antimatroids, and the transportation problem with forbidden arcs

DOI10.1016/0024-3795(90)90393-QMaRDI QIDQ916563zbMATH OpenFDO

Authors Brenda L. Dietrich

Publication date 1990

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

zbMATH Keywords

Monge sequencesantimatroid interpretationforbidden arcs

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3880732 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• A circuit set characterization of antimatroids
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• An algorithm for the detection and construction of Monge sequences
• Matroids and antimatroids - a survey

Cited in

(16)

• Minimizing the number of tardy job units under release time constraints
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
• 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
• On a transport problem and monoids of non-negative integers
• Allocation under a general substitution structure
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Robinsonian matrices: recognition challenges
• Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
• Some of my favorite integer programming applications at IBM
• A fast bipartite network flow algorithm for selective assembly
• Optimal couplings are totally positive and more

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)