A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems.
Mohand-Said MezmazNouredine MelabEl-Ghazali TalbiPublished in: IPDPS (2007)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- combinatorial optimization problems
- grid enabled
- branch and bound
- metaheuristic
- discrete optimization
- traveling salesman problem
- simulated annealing
- continuous optimization problems
- optimization problems
- finding an optimal solution
- variable ordering
- precedence constraints
- grid computing
- lagrangian relaxation
- single machine scheduling problem
- vehicle routing problem
- exact algorithms
- ant colony optimization
- integer variables
- evolutionary algorithm
- knapsack problem
- max sat
- human centered
- web portal
- optimal solution
- objective function