Pages that link to "Item:Q1261382"
From MaRDI portal
The following pages link to The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382):
Displaying 14 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)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- (Q3216698) (← links)
- An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- The parking warden tour problem (Q6092645) (← links)