Crossref
Connectedness of Solution Sets and a Sharp Bound for the Number of its Components in Polynomial Vector Optimization
International Journal of Computer Applications · 30.05.2026 · 187 (109) · 1-10
DOI: 10.5120/ijca6d0a388f86f8 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Computer Applications, online erschienen am 30.05.2026. Verfasst von Triloki Nath und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Nath, T., & Khare, A. (2026). Connectedness of Solution Sets and a Sharp Bound for the Number of its Components in Polynomial Vector Optimization. International Journal of Computer Applications, 187(109), 1-10. https://doi.org/10.5120/ijca6d0a388f86f8
Vancouver
Nath T, Khare A. Connectedness of Solution Sets and a Sharp Bound for the Number of its Components in Polynomial Vector Optimization. International Journal of Computer Applications. 2026;187(109):1-10. doi:10.5120/ijca6d0a388f86f8
BibTeX
@article{Nath2026,
author = {Nath, Triloki and Khare, Abeka},
title = {Connectedness of Solution Sets and a Sharp Bound for the Number of its Components in Polynomial Vector Optimization},
journal = {International Journal of Computer Applications},
year = {2026},
volume = {187},
number = {109},
pages = {1--10},
doi = {10.5120/ijca6d0a388f86f8}
}
EUVIMED