On the recognition of permuted Supnick and incomplete Monge matrices

DOI10.1007/s002360050058zbMath0858.68042OpenAlexW4231672148MaRDI QIDQ1924991

Rüdiger Rudolf, Vladimir G. Deǐneko, Gerhard J. Woeginger

Publication date: 27 October 1996

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050058

zbMATH Keywords

incomplete Monge matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

On the traveling salesman problem with a relaxed Monge matrix ⋮ The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Perspectives of Monge properties in optimization ⋮ Open shop scheduling with synchronization ⋮ Estimation of Monge matrices ⋮ Four-point conditions for the TSP: the complete complexity classification

This page was built for publication: On the recognition of permuted Supnick and incomplete Monge matrices