Cited in
(only showing first 100 items - show all)- Parallel Ant Colonies for the quadratic assignment problem
- Backbone analysis and algorithm design for the quadratic assignment problem
- Simulated annealing with an optimal fixed temperature
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
- Probabilistic stopping rules for GRASP heuristics and extensions
- COSEARCH: A parallel cooperative metaheuristic
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- scientific article; zbMATH DE number 1173721 (Why is no real title available?)
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- Dual ascent: variations of a theme
- Interior point methods 25 years later
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Solving the quadratic assignment problem using F-MSG algorithm
- Embedding signed graphs in the line
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- A Survey of Approximation Results for Local Search Algorithms
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- 2DPackLib
- An analysis of parameter adaptation in reactive tabu search
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- Integrating combinatorial algorithms into a linear programming solver
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- scientific article; zbMATH DE number 714538 (Why is no real title available?)
- scientific article; zbMATH DE number 2013511 (Why is no real title available?)
- scientific article; zbMATH DE number 1508175 (Why is no real title available?)
- scientific article; zbMATH DE number 1569485 (Why is no real title available?)
- scientific article; zbMATH DE number 1843033 (Why is no real title available?)
- An ejection chain algorithm for the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- New linearizations of quadratic assignment problems
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Selected topics on assignment problems
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- Improved discrete reformulations for the quadratic assignment problem
- 2DPackLib: a two-dimensional cutting and packing library
- Finding optimal solutions to several gray pattern instances
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- A penalty-based multi-objectivization approach for single objective optimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- An efficient continuation method for quadratic assignment problems
- A trust branching path heuristic for permutation problems
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Solving multi objective facility layout problem by modified simulated annealing
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Global optimality conditions and optimization methods for quadratic assignment problems
- Autocorrelation measures for the quadratic assignment problem
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Leveraging special-purpose hardware for local search heuristics
- Revisiting simulated annealing: a component-based analysis
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- A note on a polynomial time solvable case of the quadratic assignment problem
- Ant colonies for the quadratic assignment problem
- Doubly constrained network for combinatorial optimization
- Location, scheduling, design and integer programming
- Quantile and mean value measures of search process complexity
- Algorithms – ESA 2005
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- A new solution method based on Lagrangian relaxation for the quadratic assignment problem
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- The quadratic assignment problem. Theory and algorithms
- Lagrangian relaxation graph matching
- Evolutionary Computation in Combinatorial Optimization
- 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
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Optimization of the quadratic assignment problem using an ant colony algorithm
- On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks
- A survey for the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- scientific article; zbMATH DE number 2040635 (Why is no real title available?)
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- A splitting method for orthogonality constrained problems
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- 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
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- scientific article; zbMATH DE number 1487609 (Why is no real title available?)
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A novel chaotic search for quadratic assignment problems
- An efficient inexact ABCD method for least squares semidefinite programming
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
This page was built for software: QAPLIB
