The following pages link to (Q4762467):
Displaying 14 items.
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- On a conjecture related to geometric routing (Q2575088) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- The capacitated arc routing problem with refill points (Q2643817) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- (Q4510100) (← links)
- (Q5290824) (← links)