A polynomially solvable class of quadratic semi-assignment problems

DOI10.1016/0377-2217(95)00053-4zbMath0924.90062OpenAlexW2009978643MaRDI QIDQ1278260

Federico Malucelli

Publication date: 22 February 1999

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)00053-4

zbMATH Keywords

quadratic programmingtimetabling

Mathematics Subject Classification ID

Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (9)

The bipartite quadratic assignment problem and extensions ⋮ 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 ⋮ Room allocation: a polynomial subcase of the quadratic assignment problem ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ A study of the quadratic semi-assignment polytope ⋮ Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints

Cites Work

• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• Schedule synchronization for public transit networks
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Lower bounds for the quadratic semi-assignment problem
• An algorithm for the multiprocessor assignment problem
• P-Complete Approximation Problems

This page was built for publication: A polynomially solvable class of quadratic semi-assignment problems