Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
From MaRDI portal
(Redirected from Publication:976396)
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
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 635066 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch and bound algorithm for the generalized assignment problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A survey for the quadratic assignment problem
- A survey of algorithms for the generalized assignment problem
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- An algorithm for the multiprocessor assignment 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
- Assignment Problems and the Location of Economic Activities
- Best reduction of the quadratic semi-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
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Lagrangean relaxation. (With comments and rejoinder).
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Recent advances in the solution of quadratic assignment problems
- Selected topics on assignment problems
- Simulated annealing applied to the process allocation problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- 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
- The generalized assignment problem
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- The service allocation problem at the Gioia Tauro maritime terminal
- The volume algorithm: Producing primal solutions with a subgradient method
Cited in
(14)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- An exact algorithm for the general quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- General forms of the quadratic assignment problem
- 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
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- An algorithm for the generalized quadratic assignment problem
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Probabilistic tabu search for the cross-docking assignment problem
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- GRASP with path-relinking for the generalized quadratic assignment problem
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
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)
