QAPLIB

swMATH751MaRDI QIDQ13502FDOQ13502

Author name not available (Why is that?)

Official website: http://www.opt.math.tugraz.at/qaplib/

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
• 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
• 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
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Ant colonies for the quadratic assignment problem
• 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
• 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
• 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?)
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Random assignment problems
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• Title not available (Why is that?)
• GRASP
• TSPLIB
• GRASP_QAP
• CirCut
• PCx
• PDNET
• BG-WalkSAT
• libcgrpp
• SpeeDP
• SimCList
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• Algorithm 996
• SDP_S
• FANT
• Biq Mac
• CVRPSEP
• BiqMac
• LOLIB
• Algorithm 815
• Algorithm 797
• Algorithm 787
• DISCO
• SDPNAL+
• Wumpus
• Algorithm 769
• DOT
• 2DCPackGen
• Semidefinite programming relaxations for the quadratic assignment problem
• Algorithm 769
• A feasible method for optimization with orthogonality constraints
• A parallel ordering problem in facilities layout
• QSDPNAL
• HAS-QAP
• BOB
• PPROJ
• QAPgrid
• BPPLIB
• HAS-SOP
• mmgraph
• ADMM_QAP
• BBCPOP
• 2EBD-HPE
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
• MIPLIBing
• Local minima and convergence in low-rank semidefinite programming
• A new library of structured semidefinite programming instances
• SDP relaxations for some combinatorial optimization problems
• Locating sets of identical machines in a linear layout
• Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
• Recent advances in the solution of quadratic assignment problems
• 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
• 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
• 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 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
• A new exact discrete linear reformulation of the quadratic assignment problem

This page was built for software: QAPLIB