Pages that link to "Item:Q336459"
From MaRDI portal
The following pages link to Improved bounds for large scale capacitated arc routing problem (Q336459):
Displaying 21 items.
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
- New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← 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)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
