Bounds and valid inequalities for the fixed-route vehicle-refueling problem.
Arne SchulzYoshinori SuzukiPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- valid inequalities
- lower and upper bounds
- linear relaxation
- lower bound
- upper bound
- integer programming
- traveling salesman problem
- linear programming
- cutting plane
- cutting plane algorithm
- mixed integer programming
- mixed integer linear programs
- mixed integer
- feasible solution
- linear programming relaxation
- convex hull
- column generation
- network design problem
- vehicle routing problem with time windows
- integer programming formulation
- lagrangian relaxation
- integer program
- facet defining inequalities
- minimum cost
- primal dual
- shortest path
- travel time
- branch and bound search
- continuous variables
- genetic algorithm
- combinatorial optimization
- linear program
- complex systems
- optimization problems
- worst case
- optimal solution