Pages that link to "Item:Q4006902"
From MaRDI portal
The following pages link to An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint (Q4006902):
Displaying 9 items.
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)