Publication:5287166
From MaRDI portal
zbMath0787.90102MaRDI QIDQ5287166
Yasufumi Saruwatari, Naonori Nishida, R. Hirabayashi
Publication date: 19 May 1994
matching; branch and bound; travelling salesman; exact algorithm; capacitated arc routing; node duplication lower bounding
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
The open capacitated arc routing problem, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, An improved heuristic for the capacitated arc routing problem, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Evolutionary algorithms for periodic arc routing problems, A cutting plane algorithm for the capacitated arc routing problem, A guided local search heuristic for the capacitated arc routing problem, An efficient transformation of the generalized vehicle routing problem, Lower and upper bounds for the mixed capacitated arc routing problem, A scatter search for the periodic capacitated arc routing problem, A Decade of Capacitated Arc Routing
