Solving large quadratic assignment problems on computational grids
From MaRDI portal
Publication:1849534
DOI10.1007/s101070100255zbMath1030.90105OpenAlexW2063790063MaRDI QIDQ1849534
Jean-Pierre Goux, Jeff Linderoth, Kurt M. Anstreicher, Nathan W. Brixius
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100255
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (52)
Taking advantage of symmetry in some quadratic assignment problems ⋮ \texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound ⋮ Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem ⋮ A cooperative parallel tabu search algorithm for the quadratic assignment problem ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Variable neighborhood search for the workload balancing problem in service enterprises ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ An efficient continuation method for quadratic assignment problems ⋮ Bounds for the quadratic assignment problem using the bundle method ⋮ A level-2 reformulation-linearization technique bound for the quadratic assignment problem ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ A new exact discrete linear reformulation of the quadratic assignment problem ⋮ Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem ⋮ Minimum energy configurations on a toric lattice as a quadratic assignment problem ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ The MIN-cut and vertex separator problem ⋮ Mapping the convergence of genetic algorithms ⋮ New linearizations of quadratic assignment problems ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Loop based facility planning and material handling ⋮ Assignment problems with changeover cost ⋮ A new relaxation framework for quadratic assignment problems based on matrix splitting ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ A performance guarantee heuristic for electronic components placement problems including thermal effects ⋮ Iterated local search for the quadratic assignment problem ⋮ The empirical behavior of sampling methods for stochastic programming ⋮ On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Optimised Recovery with a Coordinated Checkpoint/Rollback Protocol for Domain Decomposition Applications ⋮ Challenges in Enterprise Wide Optimization for the Process Industries ⋮ Analysis of stochastic problem decomposition algorithms in computational grids ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Uses Software
This page was built for publication: Solving large quadratic assignment problems on computational grids
