Multi-Objective Minimum Spanning Tree via NSGA-II with Local Search R package momst version 0.1.1 Solves the Multi-Criteria Minimum Spanning Tree (mc-MST) problem on complete weighted graphs by combining the Non-dominated Sorting Genetic Algorithm II (NSGA-II) with optional Pareto local search operators. Chromosomes are represented as Prufer sequences so that every random individual decodes to a valid spanning tree (Cayley's theorem), avoiding repair operators. Four solver variants are provided: pure NSGA-II ("base"), Path Relinking ("PR"), Pareto Local Search ("PLS"), and Tabu Search ("TS"). The package supports 2 and 3 objective formulations and provides convenience functions to plot Pareto fronts and best-compromise spanning trees. This package is the reference implementation of the method described in Parraga-Alava, Inostroza-Ponta and Dorn (2017) <doi:10.1109/CEC.2017.7969432>. Software Depends: R (>= 4.0) Imports: stats, utils, graphics Suggests: igraph, knitr, rmarkdown, testthat (>= 3.0.0) Jorge A. Parraga-Alava <jorge.parraga@utm.edu.ec> Comprehensive R Archive Network (CRAN) Jorge A. Parraga-Alava [aut, cre] (ORCID: <https://orcid.org/0000-0001-8558-9122>) GPL (>= 3) 2026-06-22 application/tgz https://CRAN.R-project.org/package=momst doi:10.32614/CRAN.package.momst