Publication | Closed Access

A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound

Branch-and-bound AlgorithmEngineeringMixed Zero–oneInteger OptimizationComputer EngineeringMixed Integer OptimizationComputational ComplexityLinear ProgrammingParallel ComputingCo-operative Parallel HeuristicInteger ProgrammingOperations Research