The following pages link to (Q2770548):
Displaying 25 items.
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- The open capacitated arc routing problem (Q716347) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
- Hybrid genetic algorithm for the open capacitated arc routing problem (Q1652524) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- A guided local search procedure for the multi-compartment capacitated arc routing problem (Q2270452) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem (Q2475838) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
- A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- An improved multi-objective framework for the rich arc routing problem (Q6047893) (← links)
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
