New linearizations of quadratic assignment problems
From MaRDI portal
Recommendations
- A new linearization method for quadratic assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Improved discrete reformulations for the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 5040085 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A survey for the quadratic assignment problem
- A theorem on flows in networks
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- Algorithms for stochastic mixed-integer programming models
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment Problems and the Location of Economic Activities
- Branch-and-price: Column generation for solving huge integer programs
- Combinatorial Properties of Matrices of Zeros and Ones
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comparison of iterative searches for the quadratic assignment problem
- Cutting planes in integer and mixed integer programming
- Effective formulation reductions for the quadratic assignment problem
- Introduction to Stochastic Programming
- Matrices of zeros and ones
- Non-standard approaches to integer programming
- On the degrees of the vertices of a directed graph
- On the quadratic assignment problem
- P-Complete Approximation Problems
- Partitioning procedures for solving mixed-variables programming problems
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Recent advances in the solution of quadratic assignment problems
- Solving large quadratic assignment problems in parallel
- Solving large quadratic assignment problems on computational grids
- Studies on directed graphs. I, II
- The Decomposition Algorithm for Linear Programs
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
Cited in
(14)- A new exact discrete linear reformulation of the quadratic assignment problem
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Improved discrete reformulations for the quadratic assignment problem
- A new solution method by linearization for a special kind of quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
- A new form of the quadratic assignment problem and approximate solutions
- scientific article; zbMATH DE number 5556512 (Why is no real title available?)
- Generating QAP instances with known optimum solution and additively decomposable cost function
- A new linearization method for quadratic assignment problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: New linearizations of quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761235)
