An exact algorithm for the minimum squared load assignment problem
From MaRDI portal
Publication:1734825
DOI10.1016/j.cor.2019.02.011zbMath1458.90439OpenAlexW2915234525MaRDI QIDQ1734825
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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ A note on the exact solution of the minimum squared load assignment problem
Cites Work
- Unnamed Item
- Inequity averse optimization in operational research
- The bipartite quadratic assignment problem and extensions
- A survey for the quadratic assignment problem
- Assignment problems: a golden anniversary survey
- A study of the quadratic semi-assignment polytope
- A survey of algorithms for the generalized assignment problem
- A polynomially solvable class of quadratic semi-assignment problems
- Lower bounds for the quadratic semi-assignment problem
- The Boolean quadratic programming problem with generalized upper bound constraints
- An algorithm for the multiprocessor assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- The Quadratic Assignment Problem
- Exact Solutions to Task Allocation Problems
- Minimizing Total Costs in One-Machine Scheduling
- P-Complete Approximation Problems
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- An efficient algorithm for a task allocation problem
- Bicriteria multiresource generalized assignment problem
- A quadratic assignment problem without column constraints
