Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem.
Gopalakrishnan EaswaranHalit ÜsterPublished in: Transp. Sci. (2009)
Keyphrases
- network design problem
- benders decomposition
- tabu search
- feasible solution
- approximation algorithms
- mixed integer
- lagrangian relaxation
- network design
- metaheuristic
- simulated annealing
- branch and bound
- minimal cost
- mixed integer programming
- heuristic methods
- valid inequalities
- transportation networks
- search algorithm
- integer programming
- vehicle routing problem
- combinatorial optimization
- search space
- genetic algorithm
- scheduling problem
- exact algorithms
- branch and bound algorithm
- max sat
- column generation
- special case
- exact solution
- optimization problems
- upper bound
- np hard
- multi objective