Pages that link to "Item:Q2343981"
From MaRDI portal
The following pages link to An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981):
Displaying 7 items.
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Solving the Chinese postman problem on time varying networks with timed automata (Q2917150) (← 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)