scientific article; zbMATH DE number 1187168

zbMATH Open0910.90238MaRDI QIDQ3840375FDOQ3840375

Authors: Volker Kaibel 

Publication date: 10 August 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

branch-and-boundquadratic assignmentcutting plane procedure

Mathematics Subject Classification ID

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

Cited In (10)

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

Uses Software

• QAPLIB
• ZRAM
• ABACUS

This page was built for publication:

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