Polyhedral combinatorics of quadratic assignment problems with less objects than locations

DOI10.1007/3-540-69346-7_31MaRDI QIDQ3840375zbMATH OpenFDO

Authors Volker Kaibel

Publication date 10 August 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69346-7_31

zbMATH Keywords

branch-and-boundcutting plane procedurequadratic assignment

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1173721
• scientific article; zbMATH DE number 65167
• Lower bounds for the quadratic assignment problem
• A contribution to quadratic assignment problems
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• scientific article; zbMATH DE number 1568992
• The quadratic assignment problem. Theory and algorithms
• scientific article; zbMATH DE number 4143776
• A polynomially solvable class of quadratic semi-assignment problems

Cited in

(11)

• A study of the quadratic semi-assignment polytope
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• On the SQAP-polytope
• scientific article; zbMATH DE number 1173721 (Why is no real title available?)
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• scientific article; zbMATH DE number 1894379 (Why is no real title available?)
• An experimental study of variable depth search algorithms for the quadratic assignment problem
• Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
• The QAP-polytope and the star transformation
• Box-inequalities for quadratic assignment polytopes
• A survey for the quadratic assignment problem

Describes a project that uses

Uses Software

• QAPLIB
• ZRAM
• ABACUS

This page was built for publication: Polyhedral combinatorics of quadratic assignment problems with less objects than locations

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