Pages that link to "Item:Q4022732"
From MaRDI portal
The following pages link to The Capacitated Arc Routing Problem: Lower bounds (Q4022732):
Displaying 10 items.
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (Q4015406) (← links)
- An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- Combinatorial optimization and green logistics (Q5900891) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← 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)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection (Q6568490) (← links)