An updated annotated bibliography on arc routing problems
From MaRDI portal
Recommendations
Cites work
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- A branch-and-cut algorithm for the orienteering arc routing problem
- A branch-and-cut algorithm for the profitable windy rural postman problem
- A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
- A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
- A compact transformation of arc routing problems into node routing problems
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- A hybrid metaheuristic approach for the capacitated arc routing problem
- A lower bound for the node, edge, and arc routing problem
- A matheuristic for the team orienteering arc routing problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- A new view on rural postman based on Eulerian extension and matching
- A new view on rural postman based on Eulerian extension and matching
- A novel model for arc territory design: promoting Eulerian districts
- A survey of recent research on location-routing problems
- A survey on matheuristics for routing problems
- A taxonomical analysis, current methods and objectives on location-routing problems
- An approach to the asymmetric multi-depot capacitated arc routing problem
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- An exact algorithm for the capacitated arc routing problem with deadheading demand
- An ILP-refined tabu search for the directed profitable rural postman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- Approximating the length of Chinese postman tours
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Arc Routing
- Arc routing problems with min-max objectives
- Capacitated arc routing problem with deadheading demands
- Chinese postman problem on edge-colored multigraphs
- City-courier routing and scheduling problems
- Constant-factor approximations for capacitated arc routing without triangle inequality
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- Districting for arc routing
- Efficient algorithms for Eulerian extension
- Efficient algorithms for Eulerian extension and rural Postman
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- From few components to an Eulerian graph by adding ARCS
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Heuristics for the rural postman problem
- Heuristics for the stochastic Eulerian tour problem
- scientific article; zbMATH DE number 6741958 (Why is no real title available?)
- scientific article; zbMATH DE number 6741960 (Why is no real title available?)
- scientific article; zbMATH DE number 6741961 (Why is no real title available?)
- scientific article; zbMATH DE number 6741962 (Why is no real title available?)
- scientific article; zbMATH DE number 6741969 (Why is no real title available?)
- scientific article; zbMATH DE number 6741970 (Why is no real title available?)
- scientific article; zbMATH DE number 6741971 (Why is no real title available?)
- scientific article; zbMATH DE number 6741972 (Why is no real title available?)
- scientific article; zbMATH DE number 6741973 (Why is no real title available?)
- Improved bounds for large scale capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Local search for the undirected capacitated arc routing problem with profits
- Local search heuristics for sectoring routing in a household waste collection context
- Location arc routing problem with inventory constraints
- Location-arc routing problem: heuristic approaches and test instances
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Lower bounds for the mixed capacitated arc routing problem
- Modeling and solving the mixed capacitated general routing problem
- Multi-vehicle prize collecting arc routing for connectivity problem
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- New large-scale data instances for CARP and new variations of CARP
- New results for the directed profitable rural postman problem
- New results on the windy postman problem
- On games arising from multi-depot Chinese postman problems
- On the collaboration uncapacitated arc routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Parameterized complexity of Eulerian deletion problems
- Parameterized complexity of Eulerian deletion problems
- Parameterized complexity of the k-arc Chinese postman problem
- Plowing with precedence: a variant of the windy postman problem
- Profitable mixed capacitated arc routing and related problems
- Recent results on arc routing problems: an annotated bibliography
- Reoptimizing the rural postman problem
- Rural postman parameterized by the number of components of required edges
- Security routing games with multivehicle Chinese postman problem
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- Solution methodologies for debris removal in disaster response
- Solving the close-enough arc routing problem
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- Solving the team orienteering arc routing problem with a column generation approach
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Synchronized arc routing for snow plowing operations
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- The capacitated arc routing problem: exact algorithms
- The capacitated arc routing problem: heuristics
- The capacitated general windy routing problem with turn penalties
- The complexity of arc routing problems
- The directed profitable location rural postman problem
- The generalized arc routing problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- The hierarchical traveling salesman problem
- The mixed capacitated arc routing problem with non-overlapping routes
- The mixed capacitated general routing problem under uncertainty
- The open capacitated arc routing problem
- The orienteering problem: a survey
- The periodic capacitated arc routing problem with irregular services
- The rescheduling arc routing problem
- The rural postman problem on directed, mixed, and windy graphs
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- The stacker crane problem and the directed general routing problem
- The Stochastic Close-Enough Arc Routing Problem
- The synchronized arc and node routing problem: application to road marking
- The time-dependent prize-collecting arc routing problem
- The time-dependent rural postman problem: polyhedral results
- The undirected capacitated arc routing problem with profits
- The undirected capacitated general routing problem with profits
- The windy rural postman problem with a time-dependent zigzag option
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Variants of the capacitated arc routing problem
Cited in
(9)- Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem
- An open-source desktop application for generating arc-routing benchmark instances
- Arc routing problems: A review of the past, present, and future
- Preface: Special issue on arc routing problems
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic
- A multi-start local search matheuristic for the capacitated arc routing problem with irregular services
- Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
This page was built for publication: An updated annotated bibliography on arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496350)
