Arc Routing Problems, Part II: The Rural Postman Problem
From MaRDI portal
Publication:4861354
DOI10.1287/opre.43.3.399zbMath0853.90042OpenAlexW2126141749WikidataQ60895216 ScholiaQ60895216MaRDI QIDQ4861354
Michel Gendreau, Gilbert Laporte, H. A. Eiselt
Publication date: 6 January 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.3.399
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items
A guided local search heuristic for the capacitated arc routing problem, Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, A heuristic for the periodic rural postman problem, New results for the directed profitable rural postman problem, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Rural postman parameterized by the number of components of required edges, A minimum cost network flow model for the maximum covering and patrol routing problem, Solving the time varying postman problems with timed automata, 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, Lower bounds and heuristics for the windy rural postman problem, New heuristic algorithms for the windy rural postman problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Multi-vehicle prize collecting arc routing for connectivity 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, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, Heuristics for a dynamic rural postman problem, Arc routing under uncertainty: introduction and literature review, Postman problems on series-parallel mixed graphs, A partitioning column approach for solving LED sorter manipulator path planning problems, A new view on rural postman based on Eulerian extension and matching, Solving the Periodic Edge Routing Problem in the Municipal Waste Collection, Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems, Modeling and solving the endpoint cutting problem, An ILP-refined tabu search for the directed profitable rural postman problem, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs, Improved lower bounds and exact algorithm for the capacitated arc routing problem, A heuristic algorithm based on Monte Carlo methods for the rural postman problem., On Eulerian extensions and their application to no-wait flowshop scheduling, Undirected postman problems with zigzagging option: a cutting-plane approach, 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, Approximation algorithms for some min-max postmen cover problems, A Decade of Capacitated Arc Routing, A taboo search heuristic for the optimisation of a multistage component placement system, Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity, The undirected capacitated general routing problem with profits, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Capacitated arc routing problem with deadheading demands, Approximating Shortest Superstring Problem Using de Bruijn Graphs, Approximate solutions for the maximum benefit chinese postman problem, Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems, A comparison of two different formulations for arc routing problems on mixed graphs, A constructive heuristic for the undirected rural postman problem, The open capacitated arc routing problem, Min-Max K -vehicles windy rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography, Efficient Algorithms for Eulerian Extension, A metaheuristic for the min-max windy rural postman problem with K vehicles, The Rural Postman Problem on mixed graphs with turn penalties, The directed profitable location rural postman problem, 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, Domino sequencing: scheduling with state-based sequence-dependent setup times, Approximation algorithms for some minimum postmen cover problems, ARC: A computerized system for urban garbage collection, Forty years of periodic vehicle routing, The general routing polyhedron: A unifying framework, Differential approximation of NP-hard problems with equal size feasible solutions, New inequalities for the general routing problem, From Few Components to an Eulerian Graph by Adding Arcs, The school bus routing problem: a review, Lower bounds for the mixed capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, The rural postman problem with deadline classes, Exact approaches for the cutting path determination problem, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Heuristics for the rural postman problem, Planning models for long-haul operations of postal and express shipment companies, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, 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, Solving capacitated arc routing problems using a transformation to the CVRP, 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, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities, A cutting plane algorithm for the capacitated arc routing problem
