Pages that link to "Item:Q1265891"
From MaRDI portal
The following pages link to A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891):
Displaying 7 items.
- An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
