Cited by 124Multi-Criteria Decision MakingComplexity and Algorithms in GraphsVehicle Routing Optimization Methods

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

Gabrel, Virginie, Vanderpooten, Daniel·2002·European Journal of Operational Research

Overview

Integrity signals

Registry

Crossref · 10.1016/s0377-2217(01)00188-6

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Show all 1 references

Research works printed but not linked: 18

  1. Bensanna, E., Verfaillie, G., Agnèse, J.-C., Bataille, N., Blumstein, D., 1996. Exact and inexact methods for the daily management of an earth observation satellite. In: Proceedings of the Fourth International Symposium on Space Mission Operations and Ground Data Systems, München, Germany
  2. Bowman Jr, V.J., 1976. On the relationship of the Tchebycheff norm and the efficient frontier of multiple criteria objectives. In: Thiriez, H., Zionts, S. (Eds.), Multiple Criteria Decision Making, LNEMS 130. Springer, Berlin, pp. 76–85 · DOI
  3. Brumbaugh-Smith, 1989, An empirical investigation of some bicriterion shortest path algorithms, European Journal of Operational Research, 43, 216, 10.1016/0377-2217(89)90215-4 · DOI
  4. Clı́maco, 1982, A bicriterion shortest path algorithm, European Journal of Operational Research, 11, 399, 10.1016/0377-2217(82)90205-3 · DOI
  5. Corley, 1985, Shortest paths in networks with vector weights, Journal of Optimization Theory and Applications, 46, 79, 10.1007/BF00938761 · DOI
  6. Gardiner, L.R., Vanderpooten, D., 1997. Interactive multiple criteria procedures: Some reflections. In: Clı́maco, J. (Ed.), Multicriteria Analysis. Springer, Berlin, pp. 290–301 · DOI
  7. Gaspin, 1989, Mission scheduling, Telematics and Informatics, 6, 159, 10.1016/S0736-5853(89)80013-9 · DOI
  8. Hall, 1994, Maximising the value of a space mission, European Journal of Operational Research, 78, 224, 10.1016/0377-2217(94)90385-9 · DOI
  9. Hansen, P., 1980. Bicriterion path problem. In: Fandel, G., Gal, T. (Eds.), Multiple Criteria Decision Making: Theory and Applications, LNEMS 177. Springer, Berlin, pp. 109–127 · DOI
  10. Henig, 1985, The shortest path problem with two objective functions, European Journal of Operational Research, 25, 281, 10.1016/0377-2217(86)90092-5 · DOI
  11. Martins, 1984, On a multicriteria shortest path problem, European Journal of Operational Research, 16, 236, 10.1016/0377-2217(84)90077-8 · DOI
  12. Perny, 1998, An interactive multiobjective procedure for selecting medium-term countermeasures after nuclear accidents, Journal of MultiCriteria Decision Analysis, 7, 48, 10.1002/(SICI)1099-1360(199801)7:1<48::AID-MCDA171>3.0.CO;2-Z · DOI
  13. Tung, 1992, A multicriteria Pareto-optimal path algorithm, European Journal of Operational Research, 62, 203, 10.1016/0377-2217(92)90248-8 · DOI
  14. Ulungu, E.L, Teghem, J., 1991. The multi-objective shortest path problem: A survey. In: Cerny, M., Glückaufova, D., Loula, D. (Eds.), Proceedings of the International Workshop on Multicriteria Decision Making: Methods – Algorithms – Applications, Liblice, Czechoslovakia
  15. Vanderpooten, 1989, Description and analysis of some representative interactive multicriteria procedures, Mathematical and Computer Modelling, 12, 1221, 10.1016/0895-7177(89)90364-6 · DOI
  16. Verfaillie, G., Lemaı̂tre, M., Schieix, T., 1996. Russian doll search for solving constraint optimization problems. In: Proceedings of AAAI-96, Portland, Oregon, pp. 181–187
  17. Vincke, 1974, Problèmes multicritères, Cahiers du Centre d'Etudes de Recherche Opérationnelle, 16, 425
  18. Wierzbicki, 1986, On the completeness and constructiveness of parametric characterizations of vector optimization problems, OR Spektrum, 8, 73, 10.1007/BF01719738 · DOI

Cited by

Sorted by citations

See all 124

Metadata

Authors
Gabrel, V., & Vanderpooten, D.
Affiliations
  • Université Sorbonne Paris Nord (FR)
  • Lamsade (FR)
Corresponding author
Vanderpooten, Daniel
Venue
European Journal of Operational Research
Publisher
Elsevier BV
Published
2002-06
Volume
139
Issue
3
Pages
533-542
ISSN
0377-2217 (ISSN-L)
OpenAlex
W2050724929
Cited by
124
References
1
Citations by year
2026: 4 · 2025: 6 · 2024: 6 · 2023: 5 · 2022: 8 · 2021: 6 · 2020: 6 · 2019: 13 · 2018: 12 · 2017: 5 · 2016: 7 · 2015: 7 · 2014: 5 · 2013: 7 · 2012: 7
FWCI
2.19
Type
journal article
Language
en
Open access
closed
Locations
  • European Journal of Operational Research (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
Topics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Multi-Criteria Decision Making
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
Keywords
Earth observation satellites, efficient paths, interactive decision procedure, combinatorial optimization, satellite orbits, multi-objective optimization

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