Pages that link to "Item:Q5387396"
From MaRDI portal
The following pages link to An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem (Q5387396):
Displaying 7 items.
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891) (← links)
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem. (Q2776576) (← links)
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
- Scheduling of parallel continuous annealing lines with alternative processing modes to optimize efficiency under tardiness constraints (Q6586275) (← links)