Arc Routing Problems, Part I: The Chinese Postman Problem
From MaRDI portal
Publication:4849324
DOI10.1287/opre.43.2.231zbMath0837.90037OpenAlexW2123789618WikidataQ55968051 ScholiaQ55968051MaRDI QIDQ4849324
H. A. Eiselt, Michel Gendreau, Gilbert Laporte
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items
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, Heuristics for routes generation in pickup and delivery problem, Structural Parameterizations of the Mixed Chinese Postman Problem, 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, Hide-and-seek games on a tree to which Eulerian networks are attached, Shipper collaboration, Multi-vehicle prize collecting arc routing for connectivity problem, Hybrid genetic algorithm for the open capacitated arc routing problem, Parameterized complexity of the \(k\)-arc Chinese postman problem, Routing problems: A bibliography, 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, Modeling and solving several classes of arc routing problems as traveling salesman problems, Arc routing problems with time-dependent service costs, Heuristics for a dynamic rural postman problem, Arc routing under uncertainty: introduction and literature review, Online graph exploration: New results on old and new algorithms, Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Quantum encoding of dynamic directed graphs, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Approximation algorithms for multi-vehicle stacker crane problems, An analysis of the extended Christofides heuristic for the \(k\)-depot TSP, Lower-bounding and heuristic methods for a refuse collection vehicle routing problem, The capacitated arc routing problem with intermediate facilities, An algorithm for the hierarchical Chinese postman problem, An efficient transformation of the generalized vehicle routing problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, Network search games with immobile hider, without a designated searcher starting point, A Decade of Capacitated Arc Routing, DNA origami and the complexity of Eulerian circuits with turning costs, Capacitated arc routing problem with deadheading demands, Solution of real-world postman problems, Approximate solutions for the maximum benefit chinese postman problem, On the high multiplicity traveling salesman problem, A constructive heuristic for the undirected rural postman problem, Searching symmetric networks with Utilitarian-Postman paths, Recent results on Arc Routing Problems: An annotated bibliography, Efficient Algorithms for Eulerian Extension, The Rural Postman Problem on mixed graphs with turn penalties, OAR lib: an open source arc routing library, Approximation algorithms for some min-max and minimum stacker crane cover problems, Approximation algorithms for some min-max and minimum stacker crane cover problems, Forty years of periodic vehicle routing, The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth, Lower bounds for the mixed capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, The rural postman problem with deadline classes, Planning models for long-haul operations of postal and express shipment companies, On the hierarchical Chinese postman problem with linear ordered classes, Modeling the Pre Auction Stage The Truckload Case, A GRASP heuristic for the mixed Chinese postman problem, An integer programming approach for the Chinese postman problem with time-dependent travel time, Districting for salt spreading operations, The time-dependent rural postman problem: polyhedral results, A cutting plane algorithm for the capacitated arc routing problem
