Grouping strategies on two-phase methods for bi-objective combinatorial optimization
| Year of publication: |
2026
|
|---|---|
| Authors: | Mota, Felipe O. ; Paquete, Luís F. ; Vanderpooten, Daniel |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 185.2026, Art.-No. 107254, p. 1-11
|
| Subject: | Minimum spanning tree problem | Multi-objective combinatorial optimization | Ranking algorithms | Two-phase methods | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Two-phase strategies for the bi-objective minimum spanning tree problem
Amorosi, Lavinia, (2022)
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
-
Liang, Yile, (2024)
- More ...
-
Greedy algorithms for a class of knapsack problems with binary weights
Gorski, Jochen, (2012)
-
Computing representations using hypervolume scalarizations
Paquete, Luís F., (2022)
-
Paquete, Luís F., (2009)
- More ...