Efficient Algorithms for Solving the Shortest Covering Path Problem

DOI10.1287/trsc.28.4.317zbMath0823.90124OpenAlexW2128634324MaRDI QIDQ4834229

Erik Rolland, Hasan Pirkul, John R. Current

Publication date: 28 May 1995

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.28.4.317

zbMATH Keywords

Lagrangian relaxationbranch-and-boundheuristicleast cost pathpre-specified starting nodepre-specified terminus nodeshortest covering path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Solving a generalized traveling salesperson problem with stochastic customers ⋮ The transit route arc-node service maximization problem ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Solving the constrained shortest path problem using random search strategy ⋮ The vehicle routing-allocation problem: A unifying framework ⋮ A review of extensive facility location in networks

This page was built for publication: Efficient Algorithms for Solving the Shortest Covering Path Problem