Publication | Closed Access

A parallel depth first search branch and bound algorithm for the quadratic assignment problem

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringDiscrete OptimizationQuadratic Assignment ProblemComputational ComplexityBound AlgorithmComputer ScienceDiscrete MathematicsParallel ComputingCombinatorial OptimizationComputational GeometryBranch And BoundVariable Neighborhood SearchQuadratic ProgrammingOperations Research