Recognition of d-dimensional Monge arrays

DOI10.1016/0166-218X(92)00189-SMaRDI QIDQ1329798zbMATH OpenOpenAlexFDO

Authors Rüdiger Rudolf

Publication date 31 July 1994

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

Full work available at URL https://doi.org/10.1016/0166-218x(92)00189-s

zbMATH Keywords

\(d\)-dimensional axial transportation assignment problemMonge arraypermutations

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• On Monge sequences in \(d\)-dimensional arrays
• On the recognition of permuted bottleneck Monge matrices
• On the recognition of permuted Supnick and incomplete Monge matrices
• Weak Monge arrays in higher dimensions
• Recognizing Cartesian products of matrices and polytopes
• scientific article; zbMATH DE number 4095482
• Pattern Recognition on Oriented Matroids
• \(Q\)-matrix recognition via secondary and universal polytopes
• scientific article; zbMATH DE number 1743659
• Recognizability in m n-polypodes. II.

Cites work

• A Monge property for the \(d\)-dimensional transportation problem
• An algorithm for the detection and construction of Monge sequences
• scientific article; zbMATH DE number 432782 (Why is no real title available?)
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 4001850 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• On the Monge property of matrices
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(14)

• Efficiently solvable special cases of hard combinatorial optimization problems
• On Monge sequences in \(d\)-dimensional arrays
• Weak Monge arrays in higher dimensions
• An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra.
• Easy transportation-like problems on K-dimensional arrays
• Permuting matrices to avoid forbidden submatrices
• On the recognition of permuted bottleneck Monge matrices
• Perspectives of Monge properties in optimization
• Estimation of Monge matrices
• Supermodular functions and the complexity of MAX CSP
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
• Searching monotone multi-dimensional arrays
• The assignment problem with nearly Monge arrays and incompatible partner indices
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs

This page was built for publication: Recognition of \(d\)-dimensional Monge arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329798)