The Backboard Wiring Problem: A Placement Algorithm
From MaRDI portal
Cited in
(69)- A new exact algorithm for the solution of quadratic assignment problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- Solving the quadratic assignment problem
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Selected topics on assignment problems
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- An efficient continuation method for quadratic assignment problems
- Quadratic bottleneck problems
- Linear programming insights into solvable cases of the quadratic assignment problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- Large-scale layout of facilities using a heuristic hybrid algorithm
- A connectionist approach to the quadratic assignment problem
- An improved tabu search heuristic for solving facility layout design problems
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- A novel chaotic search for quadratic assignment problems
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- Algorithms for large scale set covering problems
- Random assignment problems
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- A modification of threshold accepting and its application to the quadratic assignment problem
- Parallel genetic algorithms with local search
- Massively parallel tabu search for the quadratic assignment problem
- On the quadratic assignment problem
- A hybrid heuristic for the facilities layout problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Optimizing simulated annealing schedules with genetic programming
- Efficient models for the facility layout problem
- Efficiency and time-cost-tradeoffs in transportation problems
- Reducibility of minimax to minisum 0-1 programming problems
- A parallel ordering problem in facilities layout
- A parallel heuristic for quadratic assignment problems
- A systematic encoding of the quadratic assignment problem onto Rydberg arrays
- The facility layout problem
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- An algorithm for quadratic assignment problems
- Optimal sequences in stochastic single machine shops
- A nonmonotone GRASP
- SDP relaxations for some combinatorial optimization problems
- An improved annealing scheme for the QAP
- Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models
- QAPLIB-A quadratic assignment problem library
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Locating facilities in three‐dimensional space by convex programming
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Problema de asignacion cuadratica multiobjetivo
- A contribution to quadratic assignment problems
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- A genetic approach to the quadratic assignment problem
- Generating quadratic assignment test problems with known optimal permutations
- Iterated local search for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- The random quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- A genetic algorithm for facility layout
- Quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
- A multi-parent genetic algorithm for the quadratic assignment problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- A revised reformulation-linearization technique for the quadratic assignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
This page was built for publication: The Backboard Wiring Problem: A Placement Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3276270)
