The Backboard Wiring Problem: A Placement Algorithm
From MaRDI portal
Publication:3276270
DOI10.1137/1003003zbMath0097.14703OpenAlexW2004229681WikidataQ126278281 ScholiaQ126278281MaRDI QIDQ3276270
Publication date: 1961
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1003003
Related Items
A multi-parent genetic algorithm for the quadratic assignment problem, Massively parallel tabu search for the quadratic assignment problem, Simulated annealing and tabu search in the long run: A comparison on QAP tasks, Large-scale layout of facilities using a heuristic hybrid algorithm, The facility layout problem, A genetic approach to the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, Locating facilities in three‐dimensional space by convex programming, A survey for the quadratic assignment problem, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A parallel ordering problem in facilities layout, A nonmonotone GRASP, A modification of threshold accepting and its application to the quadratic assignment problem, An efficient continuation method for quadratic assignment problems, Quadratic assignment problems, Parallel genetic algorithms with local search, Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models, Optimal sequences in stochastic single machine shops, An algorithm for quadratic assignment problems, 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, Solving the quadratic assignment problem, Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, Efficiency and time-cost-tradeoffs in transportation problems, On the quadratic assignment problem, The random quadratic assignment problem, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Quadratic bottleneck problems, Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, Problema de asignacion cuadratica multiobjetivo, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Solving the quadratic assignment problem by the repeated iterated tabu search method, Random assignment problems, A connectionist approach to the quadratic assignment problem, Generating quadratic assignment test problems with known optimal permutations, Selected topics on assignment problems, A genetic algorithm for facility layout, A polynomial algorithm for recognizing bounded cutwidth in hypergraphs, A hybrid heuristic for the facilities layout problem, A parallel heuristic for quadratic assignment problems, Iterated local search for the quadratic assignment problem, 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, A contribution to quadratic assignment problems, An algorithm for the quadratic assignment problem using Benders' decomposition, SDP Relaxations for Some Combinatorial Optimization Problems, An improved annealing scheme for the QAP, Optimizing simulated annealing schedules with genetic programming, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, Lower bounds for nonlinear assignment problems using many body interactions, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, An improved tabu search heuristic for solving facility layout design problems, Algorithms for large scale set covering problems, Efficient models for the facility layout problem, A novel chaotic search for quadratic assignment problems, QAPLIB-A quadratic assignment problem library, An exact algorithm for the general quadratic assignment problem, Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
