Pages that link to "Item:Q2116901"
From MaRDI portal
The following pages link to The min-max close-enough arc routing problem (Q2116901):
Displaying 7 items.
- A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- Solving the close-enough arc routing problem (Q2811327) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- On the minimum dummy-arc problem (Q4201824) (← links)
- The stochastic close-enough arc routing problem (Q4565785) (← links)