A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
From MaRDI portal
(Redirected from Publication:1296800)
Recommendations
Cites work
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A New Lower Bound for the Quadratic Assignment Problem
- A parallel branch and bound algorithm for the quadratic assignment problem
- Algorithms for the Assignment and Transportation Problems
- Assignment Problems and the Location of Economic Activities
- Hospital Layout as a Quadratic Assignment Problem
- scientific article; zbMATH DE number 3644805 (Why is no real title available?)
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 714528 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 3236615 (Why is no real title available?)
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- On lower bounds for a class of quadratic 0,1 programs
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- QAPLIB-A quadratic assignment problem library
- Quadratic assignment problems
- The quadratic assignment problem
Cited in
(22)- An algorithm for the generalized quadratic assignment problem
- A new adaptive Hungarian mating scheme in genetic algorithms
- New linearizations of quadratic assignment problems
- The linearization problem of a binary quadratic problem and its applications
- RLT insights into lift-and-project closures
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Probabilistic subproblem selection in branch-and-bound algorithms
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- Finding a b-matching that embeds the maximum number of edge pairs in a given set
- 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
- Bounds for the quadratic assignment problem using the bundle method
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296800)
