default search action
Thibaut Feydy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
- [b1]Thibaut Feydy:
Constraint programming: improving propagation. University of Melbourne, Parkville, Victoria, Australia, 2010
Journal Articles
- 2014
- [j4]Peter J. Stuckey, Thibaut Feydy, Andreas Schutt, Guido Tack, Julien Fischer:
The MiniZinc Challenge 2008-2013. AI Mag. 35(2): 55-60 (2014) - 2013
- [j3]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark G. Wallace:
Solving RCPSP/max by lazy clause generation. J. Sched. 16(3): 273-289 (2013) - 2011
- [j2]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark G. Wallace:
Explaining the cumulative propagator. Constraints An Int. J. 16(3): 250-282 (2011) - 2009
- [j1]Thibaut Feydy, Peter J. Stuckey:
Propagating systems of dense linear integer constraints. Constraints An Int. J. 14(2): 235-253 (2009)
Conference and Workshop Papers
- 2017
- [c12]Kenneth D. Young, Thibaut Feydy, Andreas Schutt:
Constraint Programming Applied to the Multi-Skill Project Scheduling Problem. CP 2017: 308-317 - 2016
- [c11]Thibaut Feydy, Peter J. Stuckey:
Interval Constraints with Learning: Application to Air Traffic Control. CP 2016: 224-232 - 2013
- [c10]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey:
Scheduling Optional Tasks with Explanation. CP 2013: 628-644 - [c9]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey:
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint. CPAIOR 2013: 234-250 - 2012
- [c8]Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Explaining alldifferent. ACSC 2012: 115-124 - [c7]Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Explaining Flow-Based Propagation. CPAIOR 2012: 146-162 - 2011
- [c6]Thibaut Feydy, Zoltan Somogyi, Peter J. Stuckey:
Half Reification and Flattening. CP 2011: 286-301 - 2010
- [c5]Timo Berthold, Thibaut Feydy, Peter J. Stuckey:
Rapid Learning for Binary Programs. CPAIOR 2010: 51-55 - 2009
- [c4]Thibaut Feydy, Peter J. Stuckey:
Lazy Clause Generation Reengineered. CP 2009: 352-366 - [c3]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark Wallace:
Why Cumulative Decomposition Is Not as Bad as It Sounds. CP 2009: 746-761 - 2008
- [c2]Thibaut Feydy, Andreas Schutt, Peter J. Stuckey:
Global difference constraint propagation for finite domain solvers. PPDP 2008: 226-235 - 2007
- [c1]Thibaut Feydy, Peter J. Stuckey:
Propagating dense systems of integer linear equations. SAC 2007: 306-310
Informal and Other Publications
- 2015
- [i4]Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Unsatisfiable Cores and Lower Bounding for Constraint Programming. CoRR abs/1508.06096 (2015) - 2013
- [i3]Nicholas Downing, Thibaut Feydy, Peter J. Stuckey:
Unsatisfiable Cores for Constraint Programming. CoRR abs/1305.1690 (2013) - 2012
- [i2]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey:
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint. CoRR abs/1208.3015 (2012) - 2010
- [i1]Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark G. Wallace:
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation. CoRR abs/1009.0347 (2010)
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 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint