Pages that link to "Item:Q2001874"
From MaRDI portal
The following pages link to A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874):
Displaying 10 items.
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- Solving the close-enough arc routing problem (Q2811327) (← links)
- The stochastic close-enough arc routing problem (Q4565785) (← links)
- An improved multi-objective framework for the rich arc routing problem (Q6047893) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)