QAPLIB - a quadratic assignment problem library
From MaRDI portal
(Redirected from Publication:1361076)
Recommendations
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
- QAPLIB
- A greedy genetic algorithm for the quadratic assignment problem
- Solving multi objective facility layout problem by modified simulated annealing
- Locating names on vertices of a transaction network
- 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
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- 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
- Penalty weights in QUBO formulations: permutation problems
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
- A landscape-based analysis of fixed temperature and simulated annealing
- A cutoff time strategy based on the coupon collector's problem
- A penalty-based multi-objectivization approach for single objective optimization
- QPLIB: a library of quadratic programming instances
- 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
- A multi-parent genetic algorithm for the quadratic assignment problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Integrating combinatorial algorithms into a linear programming solver
- A parallel water flow algorithm with local search for solving the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- An efficient continuation method for quadratic assignment problems
- New variable-length data compression scheme for solution representation of meta-heuristics
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- SDP relaxations for some combinatorial optimization problems
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- L_p-norm regularization algorithms for optimization over permutation matrices
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- scientific article; zbMATH DE number 1803767 (Why is no real title available?)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- A parallel ordering problem in facilities layout
- A nonmonotone GRASP
- A new linearization method for quadratic assignment problems
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Two-level modified simulated annealing based approach for solving facility layout problem
- IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- scientific article; zbMATH DE number 4076975 (Why is no real title available?)
- Global optimality conditions and optimization methods for quadratic assignment problems
- Autocorrelation measures for the quadratic assignment problem
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Interior point methods 25 years later
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- A conjugate gradient method for electronic structure calculations
- A splitting method for orthogonality constrained problems
- Probabilistic stopping rules for GRASP heuristics and extensions
- An analysis of parameter adaptation in reactive tabu search
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Scalable semidefinite programming
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- An experimental comparison of algebraic crossover operators for permutation problems
- Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
- Experiments on the minimum linear arrangement problem
- Optimal mass transport for activities location problem
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Evolutionary Computation in Combinatorial Optimization
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Partial neighborhood local searches
- YAM2: yet another library for the M₂ variables using sequential quadratic programming
- gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems
- Sinkhorn Algorithm for Lifted Assignment Problems
- The fractal geometry of fitness landscapes at the local optima level
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- The repeated p-dispersion problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Different formulations of the gray pattern problem and their optimal solutions
- Where the really hard quadratic assignment problems are: the QAP-SAT instances
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- Selected topics on assignment problems
- Ensemble machine learning-based stopping rule for greedy randomized adaptive search procedure
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
This page was built for publication: QAPLIB - a quadratic assignment problem library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361076)
