A Lagrangian relaxation algorithm for sparse quadratic assignment problems

DOI10.1016/0167-6377(94)00061-AMaRDI QIDQ1904611zbMATH OpenOpenAlexFDO

Authors I. Z. Milis, Vangelis F. Magirou

Publication date 7 January 1996

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)00061-a

zbMATH Keywords

quadratic assignmenttask assignmentbranch-and-bound searchLagrangian relaxation lower bounds

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 708857
• A new solution method based on Lagrangian relaxation for the quadratic assignment problem
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree
• scientific article; zbMATH DE number 1302195
• scientific article; zbMATH DE number 714526

Cites work

• scientific article; zbMATH DE number 4199950 (Why is no real title available?)
• A parallel branch and bound algorithm for the quadratic assignment problem
• A quadratic assignment problem without column constraints
• Allocating programs containing branches and loops within a multiple processor system
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree
• An algorithm for the multiprocessor assignment problem
• Assignment Problems and the Location of Economic Activities
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• QAPLIB-A quadratic assignment problem library
• Quadratic assignment problems
• The quadratic assignment problem
• The traveling-salesman problem and minimum spanning trees: Part II
• Validation of subgradient optimization

Cited in

(12)

• scientific article; zbMATH DE number 708857 (Why is no real title available?)
• A Lagrangean Relaxation Approach for a Turbine Design Quadratic Assignment Problem
• An exact algorithm for the minimum squared load assignment problem
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph
• Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
• A new solution method based on Lagrangian relaxation for the quadratic assignment problem
• A survey for the quadratic assignment problem
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree
• Dynamic sparsification for quadratic assignment problems
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
• The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: A Lagrangian relaxation algorithm for sparse quadratic assignment problems

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