Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability

DOI10.1515/dma.2007.011zbMath1278.90290OpenAlexW1980501128MaRDI QIDQ5439039

No author found.

Publication date: 8 February 2008

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

Full work available at URL: https://doi.org/10.1515/dma.2007.011

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Discrete location and assignment (90B80)

Related Items (2)

Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices ⋮ A weighted perfect matching with constraints on weights of its parts

Cites Work

• Optimal product and server locations in one-dimensional storage racks
• Perspectives of Monge properties in optimization
• The Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities

This page was built for publication: Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability