Arc Routing Problems, Part II: The Rural Postman Problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The school bus routing problem: a review
- Lower bounds for the mixed capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Heuristics for the rural postman problem
- New inequalities for the general routing problem
- The rural postman problem with deadline classes
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- Planning models for long-haul operations of postal and express shipment companies
- Districting for salt spreading operations
- Multi-vehicle prize collecting arc routing for connectivity problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- 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
- ARC: A computerized system for urban garbage collection
- The general routing polyhedron: A unifying framework
- A GRASP heuristic for the mixed Chinese postman problem
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- A heuristic for the periodic rural postman problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Routing problems: A bibliography
- A new view on rural postman based on Eulerian extension and matching
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- 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
- Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Postman problems on series-parallel mixed graphs
- Approximation algorithms for some min-max postmen cover problems
- OAR lib: an open source arc routing library
- Domino sequencing: scheduling with state-based sequence-dependent setup times
- Exact approaches for the cutting path determination problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- New heuristic algorithms for the windy rural postman problem
- On Eulerian extensions and their application to no-wait flowshop scheduling
- 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 directed profitable location rural postman problem
- On the hierarchical Chinese postman problem with linear ordered classes
- Solving capacitated arc routing problems using a transformation to the CVRP
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Arc routing under uncertainty: introduction and literature review
- A partitioning column approach for solving LED sorter manipulator path planning problems
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- The capacitated arc routing problem with intermediate facilities
- Forty years of periodic vehicle routing
- The time-dependent rural postman problem: polyhedral results
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- New results for the directed profitable rural postman problem
- Min-Max K-vehicles windy rural postman problem
- Recent results on arc routing problems: an annotated bibliography
- Efficient algorithms for Eulerian extension
- From few components to an Eulerian graph by adding ARCS
- 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
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Recent trends in arc routing
- Solving the time varying postman problems with timed automata
- A decade of capacitated arc routing
- An ILP-refined tabu search for the directed profitable rural postman problem
- Differential approximation of NP-hard problems with equal size feasible solutions
- scientific article; zbMATH DE number 1568935 (Why is no real title available?)
- scientific article; zbMATH DE number 1568941 (Why is no real title available?)
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Approximating shortest superstring problem using de Bruijn graphs
- scientific article; zbMATH DE number 6741962 (Why is no real title available?)
- The rural postman problem on directed, mixed, and windy graphs
- Solving the periodic edge routing problem in the municipal waste collection
- Approximate solutions for the maximum benefit chinese postman problem
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- A taboo search heuristic for the optimisation of a multistage component placement system
- Modeling the Pre Auction Stage The Truckload Case
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some minimum postmen cover problems
- The Rural Postman Problem on mixed graphs with turn penalties
- Modeling and solving the endpoint cutting problem
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Preface: Special issue on arc routing problems
- A heuristic algorithm for the drone rural postman problem
- Approximation algorithms for two clustered arc routing problems
- Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic
- An adaptive large neighborhood search method for the drone-truck arc routing problem
- A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
- The open capacitated arc routing problem
- 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
- 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
- Undirected postman problems with zigzagging option: a cutting-plane approach
- A metaheuristic for the min-max windy rural postman problem with K vehicles
This page was built for publication: Arc Routing Problems, Part II: The Rural Postman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4861354)
