Algorithm for quadratic semi-assignment problem with partition size coefficients

DOI10.1007/S11590-013-0636-3MaRDI QIDQ2448190zbMATH OpenOpenAlexWikidataFDO

Authors Maciej Drwal

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-013-0636-3

zbMATH Keywords

binary programmingexact algorithmsset partition

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Recommendations

• An approximation algorithm for the generalized assignment problem
• An algorithm for flow time minimization and its asymptotic makespan properties
• An exact algorithm for the minimum squared load assignment problem
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Optimal allocation of requirements to parallel devices

Cites work

• A polynomially solvable class of quadratic semi-assignment problems
• An algorithm for the multiprocessor assignment problem
• Analytic combinatorics
• Assignment problems: a golden anniversary survey
• Correlation clustering in general weighted graphs
• Lower bounds for the quadratic semi-assignment problem
• Worst-case equilibria

Cited in

(5)

• The Boolean quadratic programming problem with generalized upper bound constraints
• An exact algorithm for the minimum squared load assignment problem
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• The bipartite quadratic assignment problem and extensions
• Algorithms and time complexity of the request-service problem

This page was built for publication: Algorithm for quadratic semi-assignment problem with partition size coefficients

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