scientific article
From MaRDI portal
Publication:3348691
zbMath0726.90041MaRDI QIDQ3348691
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Lower bounds for the quadratic assignment problem, The extended concentric tabu for the quadratic assignment problem, On linear programs with random costs, The quadratic assignment problem in the context of the printed circuit board assembly process, A survey for the quadratic assignment problem, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, A modification of threshold accepting and its application to the quadratic assignment problem, Biologically inspired parent selection in genetic algorithms, Gilmore-Lawler bound of quadratic assignment problem, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases, Mapping the convergence of genetic algorithms, Generating quadratic assignment test problems with known optimal permutations, Selected topics on assignment problems, Compounded genetic algorithms for the quadratic assignment problem, Lower bounds based on linear programming for the quadratic assignment problem, A solvable case of the quadratic assignment problem, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Some personal views on the current state and the future of locational analysis, Move based heuristics for the unidirectional loop network layout problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, QAPLIB-A quadratic assignment problem library, Integer programming formulations of discrete hub location problems, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
