Pages that link to "Item:Q340251"
From MaRDI portal
The following pages link to The time-dependent prize-collecting arc routing problem (Q340251):
Displaying 15 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)
- Time-dependent routing problems: a review (Q342083) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- Arc routing for parking enforcement officers: exact and heuristic solutions (Q2077993) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
- Freight railway operator timetabling and engine scheduling (Q2629669) (← links)
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← 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 mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)