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

DOI10.1016/J.EJOR.2014.04.004zbMATH Open1338.90423OpenAlexW2034062927MaRDI QIDQ296774FDOQ296774

Authors: Claudia Bode, Stefan Irnich 

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.004

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

zbMATH Keywords

capacitated arc-routing problemconstrained shortest pathscycle elimination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

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

Cited In (12)

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