Pages that link to "Item:Q2343077"
From MaRDI portal
The following pages link to Profitable mixed capacitated arc routing and related problems (Q2343077):
Displaying 15 items.
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
- Arc routing for parking enforcement officers: exact and heuristic solutions (Q2077993) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits (Q2627423) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- (Q5271459) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)