Publication | Closed Access

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringInteger OptimizationQuadratic Assignment ProblemSystems EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationDiscrete OptimizationBranch And BoundHungarian MethodInteger ProgrammingQuadratic ProgrammingOperations Research