swMATH751MaRDI QIDQ13502FDOQ13502
Author name not available (Why is that?)
Official website: http://www.opt.math.tugraz.at/qaplib/
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- A new exact discrete linear reformulation of the quadratic assignment problem
- A Survey of Approximation Results for Local Search Algorithms
- Dual ascent: variations of a theme
- Efficient genetic algorithms using simple genes exchange local search policy for 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
- A greedy genetic algorithm for the quadratic assignment problem
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- New linearizations of quadratic assignment problems
- An efficient continuation method for quadratic assignment problems
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Solving multi objective facility layout problem by modified simulated annealing
- Global optimality conditions and optimization methods for quadratic assignment problems
- Autocorrelation measures for the quadratic assignment problem
- Title not available (Why is that?)
- Location, scheduling, design and integer programming
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- Evolutionary Computation in Combinatorial Optimization
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Linear programming insights into solvable cases of the quadratic assignment problem
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Optimization of the quadratic assignment problem using an ant colony algorithm
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- An efficient inexact ABCD method for least squares semidefinite programming
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Test problem generator for the multidimensional assignment problem
- Title not available (Why is that?)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Three Ideas for the Quadratic Assignment Problem
- Investigating the performance of bees algorithm in solving quadratic assignment problems
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Practical performance of efficient minimum cut algorithms
- A new linearization method for quadratic assignment problems
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Bounds for the quadratic assignment problem using the bundle method
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A conjugate gradient method for electronic structure calculations
- Location and layout planning. A survey
- Approximating non-convex quadratic programs by semidefinite and copositive programming
- A parallel ordering problem in facilities layout
- Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- Title not available (Why is that?)
- Experiments on the minimum linear arrangement problem
- To lay out or not to lay out?
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- A nonmonotone GRASP
- A tabu search algorithm for the quadratic assignment problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- A heuristic method 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
- Title not available (Why is that?)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A hybrid metaheuristic for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Applying an extended guided local search to the quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- Metaheuristic downhill simplex method in combinatorial optimization
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Simulated annealing with an optimal fixed temperature
- Backbone analysis and algorithm design for the quadratic assignment problem
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
- Doubly constrained network for combinatorial optimization
- Revisiting simulated annealing: a component-based analysis
- A note on a polynomial time solvable case of the quadratic assignment problem
- Quantile and mean value measures of search process complexity
- Cvrplib
- Lagrangian relaxation graph matching
- On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks
- Lower bounds for nonlinear assignment problems using many body interactions
- A novel chaotic search for quadratic assignment problems
This page was built for software: QAPLIB
