A transportation branch and bound algorithm for solving the generalized assignment problem.
Elias Munapo'Maseka LesaoanaPhilimon NyamugureSantosh KumarPublished in: Int. J. Syst. Assur. Eng. Manag. (2015)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- finding an optimal solution
- lower bound
- branch and bound
- variable ordering
- upper bound
- optimal solution
- randomly generated
- integer variables
- np hard
- lower bounding
- test problems
- search tree
- single machine scheduling problem
- mixed integer linear programming
- precedence constraints
- upper bounding
- traveling salesman problem
- randomly generated problems
- strongly np hard
- metaheuristic
- lagrangian relaxation
- weighted max sat
- transportation networks
- max sat
- neural network
- exact solution
- maximum clique
- branch and bound method
- mathematical programming
- simulated annealing
- genetic algorithm