Arc Routing Problems, Part I: The Chinese Postman Problem
From MaRDI portal
Publication:4849324
DOI10.1287/opre.43.2.231zbMath0837.90037WikidataQ55968051 ScholiaQ55968051MaRDI QIDQ4849324
Michel Gendreau, Gilbert Laporte, H. A. Eiselt
Publication date: 25 September 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.2.231
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
Related Items
Approximate solutions for the maximum benefit chinese postman problem, The Rural Postman Problem on mixed graphs with turn penalties, Modeling the Pre Auction Stage The Truckload Case, The robot cleans up, A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, Shipper collaboration, Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles, Arc routing problems with time-dependent service costs, Heuristics for a dynamic rural postman problem, Network search games with immobile hider, without a designated searcher starting point, Lower bounds for the mixed capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, The rural postman problem with deadline classes, Modeling and solving several classes of arc routing problems as traveling salesman problems, Planning models for long-haul operations of postal and express shipment companies, Districting for salt spreading operations, A GRASP heuristic for the mixed Chinese postman problem, A cutting plane algorithm for the capacitated arc routing problem, A heuristic for the periodic rural postman problem, Time-constrained Chinese postman problems, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Routing problems: A bibliography, Lower-bounding and heuristic methods for a refuse collection vehicle routing problem, An algorithm for the hierarchical Chinese postman problem, An efficient transformation of the generalized vehicle routing problem, Solution of real-world postman problems, On the high multiplicity traveling salesman problem, A constructive heuristic for the undirected rural postman problem, On the hierarchical Chinese postman problem with linear ordered classes, The capacitated arc routing problem with intermediate facilities, Hide-and-seek games on a tree to which Eulerian networks are attached
