Pages that link to "Item:Q2664333"
From MaRDI portal
The following pages link to A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333):
Displaying 4 items.
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
- A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
- Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)