A parallel branch and bound algorithm for the quadratic assignment problem

DOI10.1016/0166-218X(87)90022-9zbMath0632.90047WikidataQ128132087 ScholiaQ128132087MaRDI QIDQ1095791

Catherine Roucairol

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

quadratic assignmentparallel branch and boundasynchronous multiprocessor machine

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (18)

An extreme point algorithm for a local minimum solution to the quadratic assignment problem ⋮ Strengthening Gilmore's bound for the quadratic assignment problem ⋮ A new exact algorithm for the solution of quadratic assignment problems ⋮ A survey for the quadratic assignment problem ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ An algorithm for quadratic assignment problems ⋮ A parallel depth first search branch and bound algorithm for the quadratic assignment problem ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem ⋮ Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem ⋮ Combinatorial aspects of construction of competition Dutch professional football leagues ⋮ The scalability analysis of a parallel tree search algorithm ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture ⋮ Lower bounds for nonlinear assignment problems using many body interactions ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method ⋮ A variant of time minimizing assignment problem

Cites Work

• Experiments with parallel algorithms for combinatorial problems
• Branching from the largest upper bound. Folklore and facts
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Unnamed Item
• Unnamed Item

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