scientific article
From MaRDI portal
Publication:3048590
zbMath0413.90058MaRDI QIDQ3048590
Peter Mark Pruzan, Jakob Krarup
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicslocation problemapproximate solutionsefficiencyquadratic assignment problemcomputational resultsinteractive modelplant layoutlayout design
Related Items
A multi-parent genetic algorithm for the quadratic assignment problem, \(f\)-flip strategies for unconstrained binary quadratic programming, Lower bounds for the quadratic assignment problem, Unnamed Item, Graph separation techniques for quadratic zero-one programming, A survey for the quadratic assignment problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Probabilistic GRASP-tabu search algorithms for the UBQP problem, A nonmonotone GRASP, A modification of threshold accepting and its application to the quadratic assignment problem, Quadratic assignment problems, Diversification-driven tabu search for unconstrained binary quadratic problems, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, A hybrid metaheuristic approach to solving the UBQP problem, Integrating combinatorial algorithms into a linear programming solver, The unconstrained binary quadratic programming problem: a survey, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, The impact of distance on location problems, Unnamed Item, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, Reducibility of minimax to minisum 0-1 programming problems, An LP-based characterization of solvable QAP instances with chess-board and graded structures, Optimization methods for mixed integer weakly concave programming problems, A neurodynamic approach to zero-one quadratic programming, Graph Similarity and Approximate Isomorphism, Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Path relinking for unconstrained binary quadratic programming, New linearizations of quadratic assignment problems, Selected topics on assignment problems, Discrete location problems with push-pull objectives, Convergence of the surrogate Lagrangian relaxation method, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Iterated local search for the quadratic assignment problem, Lower bound improvement and forcing rule for quadratic binary programming, A hybrid metaheuristic for the quadratic assignment problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems, SDP Relaxations for Some Combinatorial Optimization Problems, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Lagrangean decompositions for the unconstrained binary quadratic programming problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, Unconstrained quadratic bivalent programming problem, Linear programming insights into solvable cases of the quadratic assignment problem, One-pass heuristics for large-scale unconstrained binary quadratic problems, QAPLIB-A quadratic assignment problem library, An unconstrained quadratic binary programming approach to the vertex coloring problem, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
