46 citations · 71 across the 3 of their papers we have counts for
3 papers
On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions
Teresa Alsinet, Josep Argelich, Ramón Béjar +1
The Bipartite Polarization Problem is an optimization problem where the goal is to find the highest polarized bipartition on a weighted and labelled graph that represents a debate…
Solving Linux Upgradeability Problems Using Boolean Optimization
Josep Argelich, Daniel Le Berre, Inês Lynce +2
Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and s…
On Solving Boolean Multilevel Optimization Problems
Josep Argelich, Ines Lynce, Joao Marques-Silva
Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each i…