scientific article; zbMATH DE number 1302195
From MaRDI portal
Publication:4247462
zbMath0944.90071MaRDI QIDQ4247462
Eranda Çela, Rainer E. Burkard, Leonidas S. Pitsoulis, Panos M. Pardalos
Publication date: 26 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityquadratic programmingasymptotic behaviorbranch and boundquadratic assignment problemheuristic algorithmscutting planelinearizationscomputer codesbranch and cut algorithmspolyhedral descriptionstechnique of lower bounds
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (44)
Leveraging special-purpose hardware for local search heuristics ⋮ The quadratic assignment problem in the context of the printed circuit board assembly process ⋮ A survey for the quadratic assignment problem ⋮ Detailed layout planning for irregularly-shaped machines with transportation path design ⋮ Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Efficient random graph matching via degree profiles ⋮ Locating names on vertices of a transaction network ⋮ 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 Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ The doubly graded matrix cone and Ferrers matrices ⋮ 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 ⋮ A new greedy algorithm for the quadratic assignment problem ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ 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 ⋮ On global optimization with indefinite quadratics ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem ⋮ Revisiting simulated annealing: a component-based analysis ⋮ On improving convex quadratic programming relaxation for the quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Compact representations of all members of an independence system ⋮ Random assignment problems ⋮ Embedding signed graphs in the line ⋮ Repulsive assignment problem ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ New linearizations of quadratic assignment problems ⋮ Selected topics on assignment problems ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Loop based facility planning and material handling ⋮ A performance guarantee heuristic for electronic components placement problems including thermal effects ⋮ Modelling convex shape priors and matching based on the Gromov-Wasserstein distance ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles ⋮ A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ Subgraph Matching with Semidefinite Programming ⋮ On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
This page was built for publication:
