An algorithm for the generalized quadratic assignment problem
From MaRDI portal
Publication:1001198
DOI10.1007/s10589-007-9093-1zbMath1153.90521OpenAlexW2052636112MaRDI QIDQ1001198
Peter M. Hahn, Bum-Jin Kim, Monique Guignard, Yi-Rong Zhu, James MacGregor Smith
Publication date: 13 February 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/oid_papers/94
Combinatorial optimizationQuadratic assignment problemBranch-and-boundLagrangean dualDual ascent procedureReformulation linearization technique
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Discrete location and assignment (90B80)
Related Items
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, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, The multi-story space assignment problem, An efficient compact quadratic convex reformulation for general integer quadratic programs, The equilibrium generalized assignment problem and genetic algorithm, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Repulsive assignment problem, A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Robust Software Partitioning with Multiple Instantiation, GRASP with path-relinking for the generalized quadratic assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A new Lagrangian relaxation approach 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
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Tabu search for the multilevel generalized assignment problem
- A class of greedy algorithms for the generalized assignment problem
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- An algorithm for the multiprocessor assignment problem
- A property of assignment type mixed integer linear programming problems
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- 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
- 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
- P-Complete Approximation Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- A variable depth search algorithm with branching search for the generalized assignment problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Best reduction of the quadratic semi-assignment problem
- A tabu search heuristic for the generalized assignment problem
