scientific article; zbMATH DE number 2049010

zbMATH Open1074.90547MaRDI QIDQ4452820FDOQ4452820

Authors: Peter M. Hahn 

Publication date: 2 March 2004

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

Recommendations

• scientific article; zbMATH DE number 2049005
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
• A New Lower Bound for the Quadratic Assignment Problem
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree

zbMATH Keywords

branch-and-boundquadratic assignment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (5)

• Corrigendum to: ``Solving the family traveling salesman problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Erratum to: ``An abstract model for branching and its application to mixed integer programming
• Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
• Title not available (Why is that?)

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 Q4452820)