Pages that link to "Item:Q1887872"
From MaRDI portal
The following pages link to Heuristic method for a mixed capacitated arc routing problem: A refuse collection application (Q1887872):
Displayed 12 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows (Q375982) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
- A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)