53 citations · 146 across the 18 of their papers we have counts for
6 papers · 1 filter
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
João Cortes, Inês Lynce, Vasco Manquinho
In the last decade, a plethora of algorithms for single-objective Boolean optimization has been proposed that rely on the iterative usage of a highly effective Propositional Satisf…
Exact and approximate determination of the Pareto set using minimal correction subsets
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten +4
Recently, it has been shown that the enumeration of Minimal Correction Subsets (MCS) of Boolean formulas allows solving Multi-Objective Boolean Optimization (MOBO) formulations. Ho…
Exploiting Resolution-based Representations for MaxSAT Solving
Miguel Neves, Ruben Martins, Mikoláš Janota +2
Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of…
On When and How to use SAT to Mine Frequent Itemsets
Rui Henriques, Inês Lynce, Vasco Manquinho
A new stream of research was born in the last decade with the goal of mining itemsets of interest using Constraint Programming (CP). This has promoted a natural way to combine comp…
On Improving Local Search for Unsatisfiability
David Pereira, Inês Lynce, Steven Prestwich
Stochastic local search (SLS) has been an active field of research in the last few years, with new techniques and procedures being developed at an astonishing rate. SLS has been tr…
Symmetry Breaking for Maximum Satisfiability
Joao Marques-Silva, Ines Lynce, Vasco Manquinho
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred…