Best reduction of the quadratic semi-assignment problem
From MaRDI portal
Publication:5931788
DOI10.1016/S0166-218X(00)00257-2zbMath0987.90065OpenAlexW1999899938MaRDI QIDQ5931788
Alain Billionnet, Sourour Elloumi
Publication date: 17 June 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00257-2
Related Items
A survey for the quadratic assignment problem ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints ⋮ Inductive linearization for binary quadratic programs with linear constraints ⋮ Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Exact solution of emerging quadratic assignment problems ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ An algorithm for the generalized quadratic assignment problem ⋮ A study of the quadratic semi-assignment polytope ⋮ Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Cites Work
- Unnamed Item
- On the quadratic assignment problem
- Location, scheduling, design and integer programming
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- Unconstrained 0-1 optimization and Lagrangean relaxation
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An efficient algorithm for a task allocation problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- A Selection Problem of Shared Fixed Costs and Network Flows
