1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
François Clément, Carola Doerr, Kathrin Klamroth +1
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Followin…
Ensuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1
Given an undirected graph , a quasi-clique is a subgraph of whose density is at least . Two optimization problems can be defined for quasi-cliques: the Ma…