Home ›
Entities
› academia
› Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints
Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints
Research article (Information Sciences, 2024) · cited 20× · AI/ML
Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints
Summary
Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints is a scholarly article[1].
Key Facts
Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints. Retrieved May 24, 2026, from https://4ort.xyz/entity/balancing-pareto-front-exploration-of-non-dominated-tournament-genetic-algorithm-b-ntga-in-solving-multi-objective-np-ha
MLA“Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/balancing-pareto-front-exploration-of-non-dominated-tournament-genetic-algorithm-b-ntga-in-solving-multi-objective-np-ha.
BibTeX@misc{4ortxyz_balancing-pareto-front-exploration-of-non-dominated-tournament-genetic-algorithm-b-ntga-in-solving-multi-objective-np-ha_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints}}, year = {2026}, url = {https://4ort.xyz/entity/balancing-pareto-front-exploration-of-non-dominated-tournament-genetic-algorithm-b-ntga-in-solving-multi-objective-np-ha}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints — https://4ort.xyz/entity/balancing-pareto-front-exploration-of-non-dominated-tournament-genetic-algorithm-b-ntga-in-solving-multi-objective-np-ha (retrieved 2026-05-24)
