Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
From MaRDI portal
Publication:976396
DOI10.1016/j.ejor.2010.02.006zbMath1188.90144OpenAlexW1992110869MaRDI QIDQ976396
Monique Guignard, Peter M. Hahn, Artur Alves Pessoa, Yi-Rong Zhu
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.006
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
A new mixed integer programming model for curriculum balancing: application to a Turkish university, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Probabilistic tabu search for the cross-docking assignment problem, Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Hybrid algorithms for placement of virtual machines across geo-separated data centers
Uses Software
Cites Work
- Selected topics on assignment problems
- A survey for the quadratic assignment problem
- The service allocation problem at the Gioia Tauro maritime terminal
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- Simulated annealing applied to the process allocation problem
- An improved partial solution to the task assignment and multiway cut problems
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- The quadratic assignment problem. Theory and algorithms
- Recent advances in the solution of quadratic assignment problems
- Effective algorithm and heuristic for the generalized assignment problem.
- The volume algorithm: Producing primal solutions with a subgradient method
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- An algorithm for the multiprocessor assignment problem
- Lagrangean relaxation. (With comments and rejoinder).
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- The Quadratic Assignment Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Assignment Problems and the Location of Economic Activities
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- A branch and bound algorithm for the generalized assignment problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Best reduction of the quadratic semi-assignment problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
