Pages that link to "Item:Q1041930"
From MaRDI portal
The following pages link to Solving the prize-collecting rural postman problem (Q1041930):
Displaying 28 items.
- New results for the directed profitable rural postman problem (Q296876) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← 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)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- The target visitation arc routing problem (Q2121609) (← links)
- Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- Privatized rural postman problems (Q2496044) (← links)
- The directed profitable location rural postman problem (Q2514733) (← links)
- A scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- The restricted Chinese postman problems with penalties (Q2670442) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)