Lower bounds for the quadratic semi-assignment problem

DOI10.1016/0377-2217(95)00013-GzbMath0904.90141OpenAlexW2019426691MaRDI QIDQ1388830

Daniele Pretolani, Federico Malucelli

Publication date: 11 June 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(95)00013-g

zbMATH Keywords

lower boundsLagrangean decompositionquadratic semi-assignment problemreducible graph

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (8)

Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Algorithm for quadratic semi-assignment problem with partition size coefficients ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ A study of the quadratic semi-assignment polytope ⋮ A polynomially solvable class of quadratic semi-assignment problems ⋮ Solving semidefinite quadratic problems within nonsmooth optimization algorithms

Cites Work

• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• An algorithm for the multiprocessor assignment problem
• Allocating programs containing branches and loops within a multiple processor system
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Methods of Nonlinear 0-1 Programming
• The Recognition of Series Parallel Digraphs
• P-Complete Approximation Problems
• An efficient algorithm for a task allocation problem

This page was built for publication: Lower bounds for the quadratic semi-assignment problem