A survey of resource constrained shortest path problems: Exact solution approaches
Abstract
This article surveys the main contributions that have appeared in the scientific literature addressing resource constrained shortest path problems. The aim of this work is twofold: to give a structured survey of the literature on this topic; to provide a starting point for researchers who want to address the problems at hand. The study is focused on the relevant contributions dealing with exact solution approaches. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 183‐200 2013
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cited by
Sorted by citations
Scheduling multiple agile Earth observation satellites with multiple observations
Wang, X., Han, C., & Leus, R. (2026) · Advances in Space Research · doi:10.1016/j.asr.2025.10.042 · Cited by 24 · see citing works
A Natural Language Processing Tool to Support the Electronic Invoicing Process in Italy
Di Puglia Pugliese, L., Guerriero, F., Macrina, G., & Messina, E. (2021) · 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS) · doi:10.1109/idaacs53288.2021.9660987 · Cited by 11 · see citing works
Self-citation
- Authors
- Pugliese, L. D. P., & Guerriero, F.
- Affiliations
- University of Calabria (IT)
- Corresponding author
- Pugliese, Luigi Di Puglia
- Venue
- Networks
- Publisher
- Wiley
- Published
- 2013-06-06
- Volume
- 62
- Issue
- 3
- Pages
- 183-200
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W1995415305
- Cited by
- 147
- References
- 0
- Citations by year
- 2026: 6 · 2025: 9 · 2024: 14 · 2023: 11 · 2022: 17 · 2021: 18 · 2020: 14 · 2019: 16 · 2018: 12 · 2017: 6 · 2016: 7 · 2015: 6 · 2014: 11
- FWCI
- 8.75
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Networks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Social Sciences › Decision Sciences › Management Science and Operations Research › Resource-Constrained Project Scheduling
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Keywords
- network optimization, resource constraints, shortest path algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
