A parallel depth first search branch and bound algorithm for the quadratic assignment problem

DOI10.1016/0377-2217(93)E0334-TzbMath0906.90147OpenAlexW2044707039MaRDI QIDQ1130079

Bernard Mans, Thierry Mautor, Catherine Roucairol

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0334-t

zbMATH Keywords

quadratic assignmentparallel branch-and-bound algorithmfeeding tree

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Parallel numerical computation (65Y05)

Related Items (8)

A survey for the quadratic assignment problem ⋮ Lower bounds and exact algorithms for the quadratic minimum spanning tree problem ⋮ Location and layout planning. A survey ⋮ A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique ⋮ Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm ⋮ The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Parallel processing for difficult combinatorial optimization problems

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• QAPLIB-A quadratic assignment problem library
• On lower bounds for a class of quadratic 0,1 programs
• A parallel branch and bound algorithm for the quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• Massively parallel tabu search for the quadratic assignment problem
• The Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities
• A New Lower Bound for the Quadratic Assignment Problem
• P-Complete Approximation Problems
• Hospital Layout as a Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: A parallel depth first search branch and bound algorithm for the quadratic assignment problem