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.006zbMATH Open1188.90144OpenAlexW1992110869MaRDI QIDQ976396FDOQ976396
Authors: Artur Alves Pessoa, Peter M. Hahn, Monique Guignard, 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
Recommendations
- A revised reformulation-linearization technique for the quadratic assignment problem
- An algorithm for the generalized quadratic assignment problem
- scientific article; zbMATH DE number 708857
- An exact algorithm for the general quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A quadratically convergent algorithm for the generalized linear complementarity problem
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A new linearization method for quadratic assignment problems
- A new exact discrete linear reformulation of the quadratic assignment problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- A survey of algorithms for the generalized assignment problem
- The generalized assignment problem
- The quadratic assignment problem. Theory and algorithms
- 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
- Title not available (Why is that?)
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Selected topics on assignment problems
- The service allocation problem at the Gioia Tauro maritime terminal
- Title not available (Why is that?)
- A survey for the quadratic assignment problem
- A branch and bound algorithm for the generalized assignment problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean relaxation. (With comments and rejoinder).
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- 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
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Title not available (Why is that?)
- Recent advances in the solution of quadratic assignment problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- The quadratic assignment problem
- Effective algorithm and heuristic for the generalized assignment problem.
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- Title not available (Why is that?)
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- An algorithm for the multiprocessor assignment problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A memetic heuristic for the generalized quadratic assignment problem
- Title not available (Why is that?)
- Best reduction of the quadratic semi-assignment problem
- Improved Lagrangean decomposition: An application to 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 algorithm for finding the \(K\)-best allocations of a tree structured program
Cited In (14)
- A memetic heuristic for the generalized quadratic assignment problem
- Probabilistic tabu search for the cross-docking assignment problem
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- An algorithm for the generalized quadratic assignment problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- General forms of the quadratic assignment problem
- An exact algorithm for the general quadratic assignment problem
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
Uses Software
This page was built for publication: Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976396)
