An algorithm for the generalized quadratic assignment problem
From MaRDI portal
Recommendations
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An exact algorithm for the general quadratic assignment problem
- scientific article; zbMATH DE number 1302195
- The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm
- A new exact algorithm for the solution of quadratic assignment problems
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1488098 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (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 branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A class of greedy algorithms for the generalized assignment problem
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- 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 new Lagrangian relaxation approach to the generalized assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A property of assignment type mixed integer linear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A survey for the quadratic assignment problem
- A tabu search heuristic for the generalized assignment problem
- A variable depth search algorithm with branching search 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
- Best reduction of the quadratic semi-assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- P-Complete Approximation Problems
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Simulated annealing applied to the process allocation problem
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Tabu search for the multilevel generalized assignment problem
- 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
Cited in
(23)- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- The multi-story space assignment problem
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- The equilibrium generalized assignment problem and genetic algorithm
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- A Relaxed Assignment Algorithm For The Quadratic Assignement Problem
- An exact algorithm for the general quadratic assignment problem
- Robust software partitioning with multiple instantiation
- 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
- scientific article; zbMATH DE number 3908165 (Why is no real title available?)
- A new algorithm for the quasi-assignment problem
- An Algorithm for the Quadratic Assignment Problem
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Repulsive assignment problem
- scientific article; zbMATH DE number 7234393 (Why is no real title available?)
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- Lower and upper bounds for the non-linear generalized assignment problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
This page was built for publication: An algorithm for the generalized quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001198)
