Variable neighborhood search for stochastic linear programming problem with quantile criterion.
Sergey V. IvanovAndrey I. KibzunNenad MladenovicDragan UrosevicPublished in: J. Glob. Optim. (2019)
Keyphrases
- variable neighborhood search
- linear programming
- metaheuristic
- tabu search
- linear program
- optimal solution
- traveling salesman problem
- heuristic methods
- single machine scheduling problem
- minimum spanning tree
- vehicle routing problem
- benchmark instances
- hybrid method
- feasible solution
- np hard
- search procedure
- routing problem
- path relinking
- dynamic programming
- column generation
- integer programming
- neural network
- ant colony optimization
- lower bound
- objective function