scientific article
From MaRDI portal
Publication:3747197
zbMath0607.90026MaRDI QIDQ3747197
Gerd Finke, Franz Rendl, Rainer E. Burkard
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
Bounds for the spectrum of normal matrices, On the distance spread of cacti and bicyclic graphs, A user's guide to tabu search, Lower bounds for the quadratic assignment problem, Extensions of a tabu search adaptation to the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, Lower bounds for the spread of a Hermitian matrix, A survey for the quadratic assignment problem, Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices, Quadratic assignment problems on series-parallel digraphs, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming, A survey of hidden convex optimization, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, A classification of formulations for the (time-dependent) traveling salesman problem, Minimum energy configurations on a toric lattice as a quadratic assignment problem, A minimax assignment problem in treelike communication networks, Matrix differential equations: a continuous realization process for linear algebra problems, The eccentricity spread of weak-friendship graphs, Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis, Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation, How to park freight trains on rail-rail transshipment yards: the train location problem, Global optimization of a class of nonconvex quadratically constrained quadratic programming problems, On least distance eigenvalue of uniform hypergraphs, Lagrangean decomposition for integer nonlinear programming with linear constraints, Diffusion bank networks and capital flows, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, On improving convex quadratic programming relaxation for the quadratic assignment problem, Solving the quadratic assignment problem by the repeated iterated tabu search method, Note on the spread of real symmetric matrices with entries in fixed interval, Algorithms for robust single and multiple period layout planning for manufacturing systems, A new branch and bound algorithm for cell formation problem, Eigenanalysis-based task mapping on parallel computers with cellular networks, Discrete optimization: an Austrian view, Selected topics on assignment problems, A performance guarantee heuristic for electronic components placement problems including thermal effects, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, On adjacency-distance spectral radius and spread of graphs, Continuous relaxations for the traveling salesman problem, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, An optimal tree search method for the manufacturing systems cell formation problem, A note on lack of strong duality for quadratic problems with orthogonal constraints, A novel chaotic search for quadratic assignment problems, Convex graph invariant relaxations for graph edit distance, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
