Solving large quadratic assignment problems on computational grids
From MaRDI portal
Recommendations
- Solving large quadratic assignment problems in parallel
- scientific article; zbMATH DE number 1424212
- scientific article; zbMATH DE number 724213
- scientific article; zbMATH DE number 934533
- Very large-scale neighborhood search for the quadratic assignment problem
- Solving large MINLPs on computational grids
- A parallel heuristic for quadratic assignment problems
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
- Solving quadratic assignment problems using convex quadratic programming relaxations
Cited in
(58)- A convex optimisation framework for the unequal-areas facility layout problem
- BiqBin: moving boundaries for NP-hard problems by HPC
- The MIN-cut and vertex separator problem
- Order Scheduling Models: Hardness and Algorithms
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Analysis of stochastic problem decomposition algorithms in computational grids
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- New linearizations of quadratic assignment problems
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- On solving a hard quadratic 3-dimensional assignment problem
- An efficient continuation method for quadratic assignment problems
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- A tissue P system based solution to quadratic assignment problem
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
- Linear programming insights into solvable cases of the quadratic assignment problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- 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
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Challenges in Enterprise Wide Optimization for the Process Industries
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Solving large MINLPs on computational grids
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- SelfSplit parallelization for mixed-integer linear programming
- Bounds for the quadratic assignment problem using the bundle method
- Loop based facility planning and material handling
- Variable neighborhood search for the workload balancing problem in service enterprises
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- The empirical behavior of sampling methods for stochastic programming
- Taking advantage of symmetry in some quadratic assignment problems
- New variable-length data compression scheme for solution representation of meta-heuristics
- Mapping the convergence of genetic algorithms
- Measuring instance difficulty for combinatorial optimization problems
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- SDP relaxations for some combinatorial optimization problems
- GRASP with path-relinking for the generalized quadratic assignment problem
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Very large-scale neighborhood search for the quadratic assignment problem
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
- Assignment problems with changeover cost
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Iterated local search for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Optimised Recovery with a Coordinated Checkpoint/Rollback Protocol for Domain Decomposition Applications
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- 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
This page was built for publication: Solving large quadratic assignment problems on computational grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849534)
