On Accuracy of Approximation for the Resource Constrained Shortest Path Problem

DOI10.17516/1997-1397-2019-12-5-621-627OpenAlexW2980806337MaRDI QIDQ5853434

Aleksandr A. Soldatenko

Publication date: 18 March 2021

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu798

zbMATH Keywords

combinatorial optimizationresource constrained shortest pathgraph-based algorithmefficient approximation algorithm

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

RevTree

Cites Work

• Solving resource constrained shortest path problems with LP-based methods
• A branch-and-cut algorithm for the capacitated profitable tour problem
• The shortest route problem with constraints
• Approximation Schemes for the Restricted Shortest Path Problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Accuracy of Approximation for the Resource Constrained Shortest Path Problem