QAPLIB
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A feasible method for optimization with orthogonality constraints
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Microlay
- SDPSymmetryReduction.jl
- emili
- Location, scheduling, design and integer programming
- RACQP
- TSPLIB
- Location and layout planning. A survey
- VRPH
- The quadratic assignment problem. Theory and algorithms
- ZRAM
- Locating sets of identical machines in a linear layout
- GRASP
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- MULTI-HOPE
- A heuristic method for the quadratic assignment problem
- On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- A novel chaotic search for quadratic assignment problems
- Solving multi objective facility layout problem by modified simulated annealing
- Locating names on vertices of a transaction network
- GRASP_QAP
- PCx
- PDNET
- CirCut
- BG-WalkSAT
- Revisiting simulated annealing: a component-based analysis
- ADMM for the SDP relaxation of the QAP
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Special cases of the quadratic shortest path problem
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- BPPLIB: a library for bin packing and cutting stock problems
- Quantile and mean value measures of search process complexity
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- New linearizations of quadratic assignment problems
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A tabu search algorithm for the quadratic assignment problem
- Test problem generator for the multidimensional assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems
- Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Probability distribution of solution time in GRASP: an experimental investigation
- Applying an extended guided local search to the quadratic assignment problem
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- SpeeDP
- A modification of threshold accepting and its application to the quadratic assignment problem
- Lower bounds for the quadratic assignment problem via triangle decompositions
- libcgrpp
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- SimCList
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Practical performance of efficient minimum cut algorithms
- SDP_S
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- A proximal DC approach for quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- 2DPackLib: a two-dimensional cutting and packing library
- Finding optimal solutions to several gray pattern instances
- Leveraging special-purpose hardware for local search heuristics
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Penalty weights in QUBO formulations: permutation problems
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
- A cutoff time strategy based on the coupon collector's problem
- A penalty-based multi-objectivization approach for single objective optimization
- FANT
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Biq Mac
- Embedding signed graphs in the line
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Lagrangian relaxation graph matching
- Linear programming insights into solvable cases of the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- Breakout local search for the quadratic assignment problem
- A multi-parent genetic algorithm for the quadratic assignment problem
- Ant colony optimization for solving an industrial layout problem
- CVRPSEP
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Integrating combinatorial algorithms into a linear programming solver
- A parallel water flow algorithm with local search for solving the quadratic assignment problem
- LOLIB
- BiqMac
- Solving the quadratic assignment problem using F-MSG algorithm
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
This page was built for software: QAPLIB
