Pages that link to "Item:Q1040970"
From MaRDI portal
The following pages link to Lower bounds for the mixed capacitated arc routing problem (Q1040970):
Displaying 23 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
- The open capacitated arc routing problem (Q716347) (← links)
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study (Q2676339) (← links)
- A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
- A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
- Dissimilar arc routing problems (Q6496354) (← links)