Solving the Traveling Salesman Problem with release dates via branch and cut.
Agustín MonteroIsabel Méndez-DíazJuan José Miranda BrontPublished in: EURO J. Transp. Logist. (2023)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- release dates
- single machine scheduling problem
- single machine
- branch and bound algorithm
- precedence constraints
- scheduling problem
- processing times
- metaheuristic
- optimization problems
- ant colony optimization
- simulated annealing
- branch and bound
- parallel machines
- valid inequalities
- traveling salesman
- graph cuts
- linear programming
- supply chain
- genetic algorithm