Pages that link to "Item:Q531469"

The following pages link to Local search for the undirected capacitated arc routing problem with profits (Q531469):

Displaying 10 items.

• Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
• A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
• Efficient metaheuristics for the mixed team orienteering problem with time windows (Q1736755) (← links)
• Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)