A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound.
V. NwanaKen Darby-DowmanGautam MitraPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- branch and bound
- simulated annealing
- combinatorial optimization
- linear programming
- optimal solution
- depth first search
- column generation
- branch and bound algorithm
- search algorithm
- branch and bound procedure
- metaheuristic
- beam search
- lower bound
- tabu search
- cooperative
- tree search
- linear program
- branch and bound method
- np hard
- linear programming relaxation
- branch and bound search
- search space
- tree search algorithm
- mathematical programming
- lagrangian heuristic
- integer programming problems
- genetic algorithm
- feasible solution
- hill climbing
- network design problem
- lagrangian relaxation
- traveling salesman problem
- evolutionary algorithm
- dynamic programming
- upper bound
- heuristic solution
- search strategies
- max sat
- objective function
- integer program
- randomly generated problems
- mixed integer programming
- shared memory
- partial solutions
- iterative deepening
- knapsack problem
- game tree search
- lagrangian dual
- multi objective
- neural network
- vehicle routing problem
- multi agent
- scheduling problem
- search tree
- integer programming