Grouping strategies on two-phase methods for bi-objective combinatorial optimization

Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a dichotomic search. This phase also allows the identification of search zones that may contain other nondominated points...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 185; p. 107254
Main Authors:	Mota, Felipe O., Paquete, Luís, Vanderpooten, Daniel
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.01.2026
Subjects:	Minimum spanning tree problem Multi-objective combinatorial optimization Ranking algorithms Two-phase methods Ranking algorithms Two-phase methods Minimum spanning tree problem Multi-objective combinatorial optimization
ISSN:	0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!