Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
Felipe O. Mota, Luís Paquete, Daniel Vanderpooten
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…
cs.DS2019
One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika +2
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit…