A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem.
Sophie N. ParraghFabien TricoireWalter J. GutjahrPublished in: OR Spectr. (2022)
Keyphrases
- bi objective
- cost function
- dominating set
- computational complexity
- optimization algorithm
- optimal solution
- decomposition algorithm
- decomposition method
- dynamic programming
- mathematical model
- special case
- facility location problem
- worst case
- particle swarm optimization
- np hard
- metaheuristic
- ant colony optimization
- knapsack problem
- multi objective
- search space
- reinforcement learning