scientific article; zbMATH DE number 714526
From MaRDI portal
zbMath0817.90059MaRDI QIDQ4321546
Franz Rendl, Henry Wolkowicz, Panos M. Pardalos
Publication date: 1 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Combinatorial optimization (90C27) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions, Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, The bipartite quadratic assignment problem and extensions, A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem, A survey for the quadratic assignment problem, Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices, Spectral alignment of correlated Gaussian matrices, A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming, An efficient continuation method for quadratic assignment problems, Lower bounds for the quadratic assignment problem via triangle decompositions, Location and layout planning. A survey, Resource assignment with preference conditions, Solution methods for the balancing of jet turbines, Efficient random graph matching via degree profiles, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, On the quality of local search for the quadratic assignment problem, The multi-story space assignment problem, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, 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, NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES, The seriation problem in the presence of a double Fiedler value, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Testing correlation of unlabeled random graphs, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, 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, Global optimality conditions and optimization methods for quadratic assignment problems, The equilibrium generalized assignment problem and genetic algorithm, A quadratic simplex algorithm for primal optimization over zero-one polytopes, Interior point methods 25 years later, Distances Between Datasets, The random quadratic assignment problem, Advances in metric embedding theory, The three-dimensional assignment and partition problems. New lower bounds, Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices, On improving convex quadratic programming relaxation for the quadratic assignment problem, ADMM for the SDP relaxation of the QAP, The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases, Embedding signed graphs in the line, Eigenanalysis-based task mapping on parallel computers with cellular networks, New linearizations of quadratic assignment problems, Selected topics on assignment problems, Semidefinite programming for discrete optimization and matrix completion problems, A provable better Branch and Bound method for a nonconvex integer quadratic programming problem, Room allocation: a polynomial subcase of the quadratic assignment problem, Some global optimization problems on Stiefel manifolds, Putting continuous metaheuristics to work in binary search spaces, Effective formulation reductions for the quadratic assignment problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, Iterated local search for the quadratic assignment problem, COSEARCH: A parallel cooperative metaheuristic, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, New lower bounds for the triplanar assignment problem. Use of the classical model, Convex integer maximization via Graver bases, A solvable case of the quadratic assignment problem, GRASP with path-relinking for the generalized quadratic assignment problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases, A greedy genetic algorithm for the quadratic assignment problem, An optimal tree search method for the manufacturing systems cell formation problem, Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach, A novel chaotic search for quadratic assignment problems, Fast Fourier transform for fitness landscapes
