The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
On a multicriteria shortest path problem
Open accessAbstract
Abstract Multicriteria shortest path problems have not been treated intensively in the specialized literature, despite their potential applications. In fact, a single objective function may not be sufficient to characterize a practical problem completely. For instance, in a road network several parameters (as time, cost, distance, etc.) can be assigned to each arc. Clearly, the shortest path may be too expensive to be used. Nevertheless the decision-maker must be able to choose some solution, possibly not the best for all the criteria. In this paper we present two algorithms for this problem. One of them is an immediate generalization of the multiple labelling scheme algorithm of Hansen for the bicriteria case. Based on this algorithm, it is proved that any pair of nondominated paths can be connected by nondominated paths. This result is the support of an algorithm that can be viewed as a variant of the simplex method used in continuous linear multiobjective programming. A small example is presented for both algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Hansen, P. (1980) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-48782-8_9 · Cited by 525
A bicriterion shortest path algorithm
Clı́maco, J., & Martins, E. Q. V. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90205-3 · Cited by 219
Self-citationCunningham, W. H. (1976) · Mathematical Programming · doi:10.1007/bf01580379 · Cited by 205
Vincke, P. (1974) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 20
Cited by
A survey and annotated bibliography of multiobjective combinatorial optimization
Ehrgott, M., & Gandibleux, X. (2000) · OR Spectrum · doi:10.1007/s002910000046 · Cited by 699
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*
Bertsekas, D. P. (2005) · European Journal of Control · doi:10.3166/ejc.11.310-334 · Cited by 366
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
Metadata
- Authors
- Martins, E. Q. V.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 1984-05
- Volume
- 16
- Issue
- 2
- Pages
- 236-245
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2051956023
- Cited by
- 450
- References
- 5
- FWCI
- 2.53
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On a multicriteria shortest path problem. https://app.cochat.ai/papers/10.1016/0377-2217(84)90077-8
- The paper
- Martins, E. Q. V. (1984). On a multicriteria shortest path problem. European Journal of Operational Research. https://doi.org/10.1016/0377-2217(84)90077-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.