Pages that link to "Item:Q2811327"

The following pages link to Solving the close-enough arc routing problem (Q2811327):

Displaying 16 items.

• The generalized arc routing problem (Q1688441) (← links)
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
• A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← 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)
• Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
• A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
• An improved multi-objective framework for the rich arc routing problem (Q6047893) (← links)
• A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)