Pages that link to "Item:Q1820685"
From MaRDI portal
The following pages link to Transforming arc routing into node routing problems (Q1820685):
Displayed 11 items.
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Augment-insert algorithms for the capacitated arc routing problem (Q2276892) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- New lower bound for the capacitated arc routing problem (Q2496046) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)