An exact algorithm for the minimum squared load assignment problem

DOI10.1016/J.COR.2019.02.011MaRDI QIDQ1734825zbMATH OpenOpenAlexWikidataFDO

Authors Özlem Karsu, Meral Azizoğlu

Publication date 27 March 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.02.011

zbMATH Keywords

assignment problemboundbranchsquared load

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 3989103
• A survey of algorithms for the generalized assignment problem
• Selected topics on assignment problems
• An exact algorithm for the general quadratic assignment problem
• A Relaxed Assignment Algorithm For The Quadratic Assignement Problem

Cites work

• A Lagrangian relaxation algorithm for sparse quadratic assignment problems
• A polynomially solvable class of quadratic semi-assignment problems
• A quadratic assignment problem without column constraints
• A study of the quadratic semi-assignment polytope
• A survey for the quadratic assignment problem
• A survey of algorithms for the generalized assignment problem
• Algorithm for quadratic semi-assignment problem with partition size coefficients
• An algorithm for the multiprocessor assignment problem
• An efficient algorithm for a task allocation problem
• Assignment problems: a golden anniversary survey
• Bicriteria multiresource generalized assignment problem
• Exact solutions to task allocation problems
• Inequity averse optimization in operational research
• Lower bounds for the quadratic semi-assignment problem
• Minimizing Total Costs in One-Machine Scheduling
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Network flows. Theory, algorithms, and applications.
• P-Complete Approximation Problems
• The bipartite quadratic assignment problem and extensions
• The Boolean quadratic programming problem with generalized upper bound constraints
• The quadratic assignment problem

Cited in

(4)

• An efficient algorithm for the symmetric principal minor assignment problem
• Algorithm for quadratic semi-assignment problem with partition size coefficients
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• A note on the exact solution of the minimum squared load assignment problem

This page was built for publication: An exact algorithm for the minimum squared load assignment problem

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