Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem.
Guido Pantuza Jr.Maurício C. de SouzaPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- traveling salesman problem
- prize collecting
- lagrangian relaxation
- valid inequalities
- single machine scheduling problem
- integer programming
- combinatorial optimization
- branch and bound algorithm
- feasible solution
- column generation
- lower bound
- lower and upper bounds
- travel time
- np hard
- optimization problems
- linear programming
- dynamic programming
- ant colony optimization
- vehicle routing problem
- shortest path
- mixed integer programming
- branch and bound
- subtour elimination
- traveling salesman
- combinatorial optimization problems
- optimal solution
- special case
- linear programming relaxation
- crossover operator
- integer program
- transportation networks
- tabu search
- precedence constraints
- production planning
- linear program
- constraint programming
- objective function