Weak Monge arrays in higher dimensions

DOI10.1016/S0012-365X(98)00005-3zbMath0958.05017OpenAlexW2015562172WikidataQ126594604 ScholiaQ126594604MaRDI QIDQ1584367

Dominique Fortin, Rüdiger Rudolf

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00005-3

zbMATH Keywords

permutationlinear assignment problemMonge sequencescost-matrixweak Monge arraysweak Monge matrixweak Monge property

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Other designs, configurations (05B30)

Related Items (1)

Robinsonian matrices: recognition challenges

Cites Work

• Unnamed Item
• On the Monge property of matrices
• Monge sequences and a simple assignment algorithm
• An algorithm for the detection and construction of Monge sequences
• On Monge sequences in \(d\)-dimensional arrays
• A Monge property for the \(d\)-dimensional transportation problem
• Perspectives of Monge properties in optimization

This page was built for publication: Weak Monge arrays in higher dimensions