A note on a polynomial time solvable case of the quadratic assignment problem

DOI10.1016/J.DISOPT.2006.04.001MaRDI QIDQ865755zbMATH OpenOpenAlexFDO

Authors Güneş Erdogăn, B. Tansel

Publication date 20 February 2007

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/23641

zbMATH Keywords

quadratic assignment problemsolvability

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• A solvable case of the quadratic assignment problem
• A polynomially solvable class of quadratic semi-assignment problems
• scientific article; zbMATH DE number 591196
• A note on asymptotic properties of the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• A contribution to quadratic assignment problems
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
• scientific article; zbMATH DE number 714526

Cites work

• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A solvable case of the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The quadratic assignment problem. Theory and algorithms

Cited in

(11)

• A note on asymptotic properties of the quadratic assignment problem
• A solvable case of the quadratic assignment problem
• A polynomially solvable class of quadratic semi-assignment problems
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
• Room allocation: a polynomial subcase of the quadratic assignment problem
• Linear programming insights into solvable cases of the quadratic assignment problem
• Exact solution of two location problems via branch-and-bound
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
• An LP-based characterization of solvable QAP instances with chess-board and graded structures
• A polyhedral characterization of linearizable quadratic combinatorial optimization problems
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: A note on a polynomial time solvable case of the quadratic assignment problem

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