scientific article; zbMATH DE number 1054960
From MaRDI portal
Publication:4350080
zbMATH Open0877.90032MaRDI QIDQ4350080FDOQ4350080
Publication date: 11 December 1997
Title of this publication is not available (Why is that?)
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06)
Cited In (12)
- A scatter search for the periodic capacitated arc routing problem
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Combinatorial optimization and green logistics
- On matchings, T‐joins, and arc routing in road networks
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- The open capacitated arc routing problem
- Combinatorial optimization and green logistics
- A deterministic tabu search algorithm for the capacitated arc routing problem
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Metaheuristics: A bibliography
- Lower and upper bounds for the mixed capacitated arc routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350080)
