A unified approach to simple special cases of extremal permutation problems

DOI10.1080/02331939808844404zbMath0916.90225OpenAlexW2010547886MaRDI QIDQ4227985

No author found.

Publication date: 2 February 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844404

zbMATH Keywords

combinatorial optimizationpartial orderassignment problemfactorization of permutationsquadratic assignemnt problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ Linear programming insights into solvable cases of the quadratic assignment problem

Cites Work

• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Perspectives of Monge properties in optimization
• Assignment Problems and the Location of Economic Activities
• Unnamed Item

This page was built for publication: A unified approach to simple special cases of extremal permutation problems