QAPLIB

swMATH751MaRDI QIDQ13502FDOQ13502

Author name not available (Why is that?)

Described by source

• QAPLIB - a quadratic assignment problem library
• QAPLIB-A quadratic assignment problem library

Cited In (only showing first 100 items - show all)

• COSEARCH: A parallel cooperative metaheuristic
• 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 Survey of Approximation Results for Local Search Algorithms
• Lower bounds for the quadratic assignment problem based upon a dual formulation
• Interior point methods 25 years later
• Solving the quadratic assignment problem using F-MSG algorithm
• Integrating combinatorial algorithms into a linear programming solver
• An ejection chain algorithm for the quadratic assignment problem
• A greedy genetic algorithm for the quadratic assignment problem
• Solution bias in ant colony optimisation: Lessons for selecting pheromone models
• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• Selected topics on assignment problems
• Copositive and semidefinite relaxations of the quadratic assignment problem
• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A hybrid biased random key genetic algorithm for the quadratic assignment problem
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Global optimality conditions and optimization methods for quadratic assignment problems
• Autocorrelation measures for the quadratic assignment problem
• Ant colonies for the quadratic assignment problem
• Evolutionary Computation in Combinatorial Optimization
• The quadratic assignment problem. Theory and algorithms
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• Optimization of the quadratic assignment problem using an ant colony algorithm
• A survey for the quadratic assignment problem
• Title not available (Why is that?)
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
• A splitting method for orthogonality constrained problems
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Title not available (Why is that?)
• Three Ideas for the Quadratic Assignment Problem
• Practical performance of efficient minimum cut algorithms
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Random assignment problems
• A new linearization method for quadratic assignment problems
• Lower bounds for the quadratic assignment problem via triangle decompositions
• SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• Title not available (Why is that?)
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• Algorithm 996
• Semidefinite programming relaxations for the quadratic assignment problem
• Algorithm 769
• A feasible method for optimization with orthogonality constraints
• 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
• Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Title not available (Why is that?)
• Experiments on the minimum linear arrangement problem
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• A nonmonotone GRASP
• Local minima and convergence in low-rank semidefinite programming
• A new library of structured semidefinite programming instances
• SDP relaxations for some combinatorial optimization problems
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Locating sets of identical machines in a linear layout
• GRASP with path-relinking for the generalized quadratic assignment problem
• Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
• Very large-scale neighborhood search for the quadratic assignment problem
• Recent advances in the solution of quadratic assignment problems
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
• Probability distribution of solution time in GRASP: an experimental investigation
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• 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
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
• Breakout local search for the quadratic assignment problem
• Solving large quadratic assignment problems on computational grids
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• ADMM for the SDP relaxation of the QAP
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
• BPPLIB: a library for bin packing and cutting stock problems
• Comparison of iterative searches for the quadratic assignment problem
• A multi-depot travelling salesman problem and its iterative and integrated approaches
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• Effective formulation reductions for the quadratic assignment problem
• A revised reformulation-linearization technique for the quadratic assignment problem
• Ant colony optimization for solving an industrial layout problem
• Title not available (Why is that?)
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
• A new exact discrete linear reformulation of the quadratic assignment problem
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: QAPLIB