Josep Suy

发表

W-MiniZinc: A Proposal for Modeling Weighted CSPs with MiniZinc

Miquel Bofill, C. Ansótegui, M. Palahí, 2011 .

A Proposal for Solving Weighted CSPs with SMT

Miquel Bofill, C. Ansótegui, M. Palahí, 2011 .

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations

Miquel Bofill, Josep Suy, Mateu Villaret, 2020, Artificial Intelligence Review.

Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem

Carlos Ansótegui, Mateu Villaret, Miquel Bofill, 2011, SARA.

The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches

Miquel Bofill, Josep Suy, Mateu Villaret, 2022, Computers & Operations Research.

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints

Mateu Villaret, Miquel Bofill, Josep Suy, 2021, Artif. Intell..

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations

Mateu Villaret, Miquel Bofill, Josep Suy, 2020, Artificial Intelligence Review.

SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations

Mateu Villaret, Miquel Bofill, Josep Suy, 2019, CPAIOR.

Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems

Mateu Villaret, Miquel Bofill, Josep Suy, 2017, IJCAI.

An object-oriented approach for teaching visibility computation algorithms

Xavier Pueyo, Joan Antoni Sellarès, Josep Suy, 1996, Comput. Graph..

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints

Carlos Ansótegui, Ian Miguel, Mateu Villaret, 2019, CP.

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract)

Miquel Bofill, Josep Suy, Mateu Villaret, 2023, IJCAI.

Solving constraint satisfaction problems with SAT modulo theories

Mateu Villaret, Miquel Bofill, Miquel Palahí, 2012, Constraints.