The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
From MaRDI portal
Publication:3762097
DOI10.1080/01966324.1987.10737208zbMath0623.90083OpenAlexW2021646400WikidataQ58116978 ScholiaQ58116978MaRDI QIDQ3762097
Arjang A. Assad, Bruce L. Golden, Wen Lea Pearn
Publication date: 1987
Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01966324.1987.10737208
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Solvable cases of the \(k\)-person Chinese postman problem, A capacitated general routing problem on mixed networks, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Routing problems: A bibliography, Approximate solutions for the capacitated arc routing problem, Improved lower bounds and exact algorithm for the capacitated arc routing problem, New lower bound for the capacitated arc routing problem, The open capacitated arc routing problem, Augment-insert algorithms for the capacitated arc routing problem, Min-Max K -vehicles windy rural postman problem, A metaheuristic for the min-max windy rural postman problem with K vehicles, Transforming arc routing into node routing problems, New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem, Solving capacitated arc routing problems using a transformation to the CVRP, The arc partitioning problem, Routeing winter gritting vehicles, A cutting plane algorithm for the capacitated arc routing problem
Cites Work
