The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem

Recommendations

The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
Shortest Path Problems with Resource Constraints
Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
Cut-first branch-and-price-second for the capacitated arc-routing problem
Exploiting sparsity in pricing routines for the capacitated arc routing problem

Cites work

scientific article; zbMATH DE number 1520350 (Why is no real title available?)
scientific article; zbMATH DE number 1452994 (Why is no real title available?)
2-path cuts for the vehicle routing problem with time windows
A capacitated general routing problem on mixed networks
A guided local search heuristic for the capacitated arc routing problem
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
An exact algorithm for the capacitated arc routing problem with deadheading demand
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
Cut-first branch-and-price-second for the capacitated arc-routing problem
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Multidimensional divide-and-conquer
Network flows. Theory, algorithms, and applications.
New dynamic programming algorithms for the resource constrained elementary shortest path problem
New route relaxation and pricing strategies for the vehicle routing problem
Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
Pricing routines for vehicle routing with time windows on road networks
Recent results on arc routing problems: an annotated bibliography
Resource extension functions: properties, inversion, and generalization to segments
Shortest Path Problems with Resource Constraints
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
The Capacitated Arc Routing Problem: Lower bounds
The capacitated arc routing problem: exact algorithms
The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
The travelling salesman problem as a constrained shortest path problem: Theory and computational experience

Cited in

(12)

An efficiency-based path-scanning heuristic for the capacitated arc routing problem
The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
Path-reduced costs for eliminating arcs in routing and scheduling
Task assignment with start time-dependent processing times for personnel at check-in counters
Lagrangian relaxation for the multiple constrained robust shortest path problem
Branch-and-price approaches for the multiperiod technician routing and scheduling problem
PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
An updated annotated bibliography on arc routing problems
An approach to the asymmetric multi-depot capacitated arc routing problem
The constrained shortest path problem with stochastic correlated link travel times
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

This page was built for publication: The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296774)