Pages that link to "Item:Q975994"

The following pages link to The undirected capacitated arc routing problem with profits (Q975994):

Displaying 14 items.

• 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)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
• Efficient metaheuristics for the mixed team orienteering problem with time windows (Q1736755) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
• The directed profitable location rural postman problem (Q2514733) (← links)
• A scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• The parking warden tour problem (Q6092645) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)