Pages that link to "Item:Q340291"
From MaRDI portal
The following pages link to A lower bound for the node, edge, and arc routing problem (Q340291):
Displaying 7 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← 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)
