default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosep Suy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Miquel Bofill
, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). IJCAI 2023: 6851-6852- [c13]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract). IJCAI 2023: 6853-6857 - 2022
- [j9]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. Artif. Intell. 302: 103604 (2022) - [j8]Miquel Bofill, Jordi Coll, Gerard Martín, Josep Suy, Mateu Villaret:
The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. Comput. Oper. Res. 142: 105730 (2022) - [j7]Miquel Bofill, Jordi Coll, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
The Impact of Implied Constraints on MaxSAT B2B Instances. Int. J. Comput. Intell. Syst. 15(1): 63 (2022) - [j6]Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. J. Artif. Intell. Res. 74: 263-301 (2022) - 2021
- [i1]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints. CoRR abs/2110.08068 (2021) - 2020
- [j5]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. Artif. Intell. Rev. 53(7): 5157-5188 (2020) - [j4]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SMT encodings for Resource-Constrained Project Scheduling Problems. Comput. Ind. Eng. 149: 106777 (2020)
2010 – 2019
- 2019
- [c12]Miquel Bofill, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems. CCIA 2019: 183-192 - [c11]Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret:
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - [c10]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. CPAIOR 2019: 112-128 - 2017
- [c9]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources. CP 2017: 71-79 - [c8]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. IJCAI 2017: 555-562 - 2016
- [c7]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT. ICTAI 2016: 239-246 - 2015
- [c6]Miquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret:
MaxSAT-Based Scheduling of B2B Meetings. CPAIOR 2015: 65-73 - 2014
- [c5]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
A System for Generation and Visualization of Resource-Constrained Projects. CCIA 2014: 237-246 - [c4]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. CP 2014: 207-223 - [c3]Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret:
Scheduling B2B Meetings. CP 2014: 781-796 - 2013
- [j3]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints An Int. J. 18(2): 236-268 (2013) - 2012
- [b1]Josep Suy Franch:
A satisfiability modulo theories approach to constraint programming. University of Girona, Spain, 2012 - [j2]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving constraint satisfaction problems with SAT modulo theories. Constraints An Int. J. 17(3): 273-303 (2012) - 2011
- [c2]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. SARA 2011 - 2010
- [c1]Miquel Bofill, Josep Suy, Mateu Villaret:
A System for Solving Constraint Satisfaction Problems with SMT. SAT 2010: 300-305
1990 – 1999
- 1996
- [j1]Xavier Pueyo, Frederic Pérez, Joan Antoni Sellarès, Josep Suy:
An object-oriented approach for teaching visibility computation algorithms. Comput. Graph. 20(4): 605-610 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
