scientific article; zbMATH DE number 1302195
From MaRDI portal
Publication:4247462
asymptotic behaviorbranch and boundbranch and cut algorithmscomplexitycomputer codescutting planeheuristic algorithmslinearizationspolyhedral descriptionsquadratic assignment problemquadratic programmingtechnique of lower bounds
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Quadratic programming (90C20) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(only showing first 100 items - show all)- An algorithm for the generalized quadratic assignment problem
- An exact algorithm for the general quadratic assignment problem
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Generating quadratic assignment test problems with known optimal permutations
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Network-based formulations of the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- The doubly graded matrix cone and Ferrers matrices
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Locating names on vertices of a transaction network
- On global optimization with indefinite quadratics
- Revisiting simulated annealing: a component-based analysis
- New linearizations of quadratic assignment problems
- Room allocation: a polynomial subcase of the quadratic assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- Experimental results on quadratic assignment problem.
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A new greedy algorithm for the quadratic assignment problem
- A new necessary and sufficient global optimality condition for canonical DC problems
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Leveraging special-purpose hardware for local search heuristics
- A landscape-based analysis of fixed temperature and simulated annealing
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- Embedding signed graphs in the line
- Integer programming models for the multidimensional assignment problem with star costs
- Linear programming insights into solvable cases of the quadratic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- General forms of the quadratic assignment problem
- Efficient random graph matching via degree profiles
- The use of the ``golden section rule in probability modeling algorithms.
- SDP relaxations for some combinatorial optimization problems
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- A memetic heuristic for the generalized quadratic assignment problem
- Polynomial algorithms for solving the quadratic assignment problem on networks
- Three Ideas for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 1803767 (Why is no real title available?)
- The bipartite quadratic assignment problem and extensions
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- A contribution to quadratic assignment problems
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- Subgraph Matching with Semidefinite Programming
- scientific article; zbMATH DE number 4145666 (Why is no real title available?)
- scientific article; zbMATH DE number 3908165 (Why is no real title available?)
- scientific article; zbMATH DE number 3922368 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- A Relaxed Assignment Algorithm For The Quadratic Assignement Problem
- scientific article; zbMATH DE number 4072724 (Why is no real title available?)
- scientific article; zbMATH DE number 4076975 (Why is no real title available?)
- scientific article; zbMATH DE number 31314 (Why is no real title available?)
- scientific article; zbMATH DE number 55971 (Why is no real title available?)
- Autocorrelation measures for the quadratic assignment problem
- scientific article; zbMATH DE number 591196 (Why is no real title available?)
- scientific article; zbMATH DE number 708857 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- The quadratic Gaussian CEO problem
- scientific article; zbMATH DE number 1996465 (Why is no real title available?)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Quadratic assignment problem QAP with adaptable material handling devices
- scientific article; zbMATH DE number 761271 (Why is no real title available?)
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- The Rank-One Quadratic Assignment Problem
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Compact representations of all members of an independence system
- scientific article; zbMATH DE number 232498 (Why is no real title available?)
- A Fourier space algorithm for solving quadratic assignment problems
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- scientific article; zbMATH DE number 2196289 (Why is no real title available?)
- The Distribution of Values in the Quadratic Assignment Problem
- scientific article; zbMATH DE number 2242691 (Why is no real title available?)
- Evolutionary Computation in Combinatorial Optimization
- Quadratic assignment problems and \(M/G/C/C/\) state dependent network flows
- Exact matching of random graphs with constant correlation
- Gilmore-Lawler bound of quadratic assignment problem
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- The random quadratic assignment problem
- Finding a b-matching that embeds the maximum number of edge pairs in a given set
- Selected topics on assignment problems
- Experimental analysis of algorithms for the independent quadratic assignment problem
- Loop based facility planning and material handling
- Statistical Quantile Learning for Large Additive Latent Variable Models
- Hardware-compatible single-shot feasible-space heuristics for solving the quadratic assignment problem
- To lay out or not to lay out?
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
- The quadratic assignment problem in the context of the printed circuit board assembly process
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247462)
