A branch-and-cut algorithm for quadratic assignment problems based on linearizations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A new exact algorithm for the solution of quadratic assignment problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment Problems and the Location of Economic Activities
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Generating quadratic assignment test problems with known optimal permutations
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Numerical investigations on quadratic assignment problems
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- Solving large quadratic assignment problems in parallel
- Solving large quadratic assignment problems on computational grids
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The Backboard Wiring Problem: A Placement Algorithm
- The quadratic assignment problem
Cited in
(20)- Linearizable special cases of the quadratic shortest path problem
- A new solution method by linearization for a special kind of quadratic assignment problem
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- Exact algorithms for the quadratic linear ordering problem
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A new exact discrete linear reformulation of the quadratic assignment problem
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
- New linearizations of quadratic assignment problems
- A note on a polynomial time solvable case of the quadratic assignment problem
- scientific article; zbMATH DE number 4072724 (Why is no real title available?)
- A new formulation and an effective matheuristic for the airport gate assignment problem
- Effective formulation reductions for the quadratic assignment problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Linearizable special cases of the QAP
- A new linearization method for quadratic assignment problems
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
This page was built for publication: A branch-and-cut algorithm for quadratic assignment problems based on linearizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856686)
