A survey of multicriteria optimization or the vector maximum problem, part I: 1776?1960
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Evolutionary algorithms such as Non-Dominated Sorting Genetic Algorithm (NSGA-I) and Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) can approximate the true Pareto Optimal solutions of multi-objective problems.
“It has been shown that evolutionary algorithms such as Non-Dominated Sorting Genetic Algorithm (NSGA-I) [73] and Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [74], can approximate the true PO solutions of multi-objective problems [70].”
From Applications and Challenges of Artificial Intelligence in Space Missions (2024) · cites this paper as [73]
Cited by
Sorted by citations
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149 · see citing works
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68 · see citing works
“These best trade-off solutions are also known as Pareto Optimal (PO) solutions [71], a concept that was first proposed by Edgeworth and Pareto [72].”
BackgroundMulti-objective routing optimization using evolutionary algorithms
Yetgin, H., Cheung, K. T. K., & Hanzo, L. (2012) · 2012 IEEE Wireless Communications and Networking Conference (WCNC) · doi:10.1109/wcnc.2012.6214324 · Cited by 58 · see citing works
Quantum-Assisted Routing Optimization for Self-Organizing Networks
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L. (2014) · IEEE Access · doi:10.1109/access.2014.2327596 · Cited by 46 · see citing works
- Authors
- Stadler, W.
- Affiliations
- Technical University of Munich (DE)
- Corresponding author
- Stadler, W.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 1979-09
- Volume
- 29
- Issue
- 1
- Pages
- 1-52
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W1963679962
- Cited by
- 237
- References
- 0
- Citations by year
- 2026: 5 · 2025: 2 · 2024: 2 · 2023: 3 · 2022: 6 · 2021: 10 · 2020: 10 · 2019: 16 · 2018: 11 · 2017: 11 · 2016: 13 · 2015: 6 · 2014: 8 · 2013: 12 · 2012: 9
- FWCI
- 1.11
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Optimization Theory and Applications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Physical Sciences › Engineering › Control and Systems Engineering › Optimization and Mathematical Programming
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Keywords
- multi-objective optimization, history of optimization, Pareto optimality, Vilfredo Pareto, utility theory, preference theory, welfare theory, game theory, Borel, John von Neumann, efficiency, production economics, linear programming
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
