Arc Routing
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
Cited in
(51)- Hybrid genetic algorithm for the open capacitated arc routing problem
- The generalized arc routing problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- The periodic rural postman problem with irregular services on mixed graphs
- The windy rural postman problem with a time-dependent zigzag option
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Inventory routing with pickups and deliveries
- A matheuristic for the distance-constrained close-enough arc routing problem
- On the distance-constrained close enough arc routing problem
- Solving the length constrained K-drones rural postman problem
- Routing for unmanned aerial vehicles: touring dimensional sets
- Arc routing for parking enforcement officers: exact and heuristic solutions
- Constructing the basis path set by eliminating the path dependency
- Interpreting the basis path set in neural networks
- The target visitation arc routing problem
- Transport of skips between recycling centers and treatment facilities
- Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem
- Approximation algorithms for some min-max postmen cover problems
- Exact approaches for the cutting path determination problem
- Vehicle routing on road networks: how good is Euclidean approximation?
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- The profitable close-enough arc routing problem
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- Polynomial-time data reduction for weighted problems beyond additive goal functions
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A branch-and-cut algorithm for the profitable windy rural postman problem
- Local search heuristics for sectoring routing in a household waste collection context
- Approximation algorithms for the single robot line coverage problem
- Parameterized complexity of the k-arc Chinese postman problem
- Time-dependent routing problems: a review
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 2156293 (Why is no real title available?)
- scientific article; zbMATH DE number 1568938 (Why is no real title available?)
- scientific article; zbMATH DE number 1568940 (Why is no real title available?)
- An open-source desktop application for generating arc-routing benchmark instances
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- scientific article; zbMATH DE number 6741969 (Why is no real title available?)
- A scheme for determining vehicle routes based on Arc-based service network design
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Arc routing problems: A review of the past, present, and future
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- A parameterized lower bounding method for the open capacitated arc routing problem
- An updated annotated bibliography on arc routing problems
- Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- Approximation algorithms for two clustered arc routing problems
- On combining conventional point-to-point and automated waste collection systems
- An optimal algorithm for the stacker crane problem on fixed topologies
This page was built for publication: Arc Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256774)
