Exact solution of emerging quadratic assignment problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 3240945 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A survey for the quadratic assignment problem
- An Algorithm for the Three-Index Assignment Problem
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- An algorithm for quadratic assignment problems
- An algorithm for the multiprocessor assignment problem
- An efficient cost scaling algorithm for the assignment problem
- An improved partial solution to the task assignment and multiway cut problems
- Approximate solutions to the turbine balancing problem.
- Best reduction of the quadratic semi-assignment problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Effective algorithm and heuristic for the generalized assignment problem.
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Heuristics for biquadratic assignment problems and their computational comparison
- Letter to the Editor—The Multidimensional Assignment Problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- On the Liu-Floudas convexification of smooth programs
- Real-time dispatch of trams in storage yards
- Solution methods for the balancing of jet turbines
- Solving large quadratic assignment problems in parallel
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The Distribution of Values in the Quadratic Assignment Problem
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- The quadratic assignment problem
Cited in
(8)- A new exact algorithm for the solution of quadratic assignment problems
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- A new form of the quadratic assignment problem and approximate solutions
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
- Recent advances in the solution of quadratic assignment problems
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
This page was built for publication: Exact solution of emerging quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002542)
