A branch-and-cut algorithm for quadratic assignment problems based on linearizations
From MaRDI portal
Publication:856686
DOI10.1016/J.COR.2005.05.027zbMATH Open1102.90034OpenAlexW2120803586MaRDI QIDQ856686FDOQ856686
Authors: Güneş Erdogăn, B. Tansel 
Publication date: 7 December 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/11440
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Assignment Problems and the Location of Economic Activities
- Title not available (Why is that?)
- P-Complete Approximation Problems
- Title not available (Why is that?)
- The quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- The Backboard Wiring Problem: A Placement Algorithm
- Generating quadratic assignment test problems with known optimal permutations
- Title not available (Why is that?)
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Numerical investigations on quadratic assignment problems
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Title not available (Why is that?)
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Solving large quadratic assignment problems in parallel
- A new exact algorithm for the solution of quadratic assignment problems
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
Cited In (20)
- A new exact discrete linear reformulation of the quadratic assignment problem
- Linearizable special cases of the QAP
- New linearizations of quadratic assignment problems
- A new solution method by linearization for a special kind of quadratic assignment problem
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- A note on a polynomial time solvable case of the quadratic assignment problem
- Exact algorithms for the quadratic linear ordering problem
- A new formulation and an effective matheuristic for the airport gate assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Linearizable special cases of the quadratic shortest path problem
- Title not available (Why is that?)
- A new linearization method for quadratic assignment problems
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
- Effective formulation reductions for the quadratic assignment problem
- Title not available (Why is that?)
Uses Software
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)
