default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Guillaume Fages
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Charles Prud'homme
, Jean-Guillaume Fages:
Choco-solver: A Java library for constraint programming. J. Open Source Softw. 7(78): 4708 (2022)- 2021
- [c8]Antoine Charpentier, Jean-Guillaume Fages, Tanguy Lapègue:
COSLING Configurator. ConfWS 2021: 33-36
2010 – 2019
- 2019
- [j5]Salim Bouamama, Christian Blum, Jean-Guillaume Fages:
An algorithm based on ant colony optimization for the minimum connected dominating set problem. Appl. Soft Comput. 80: 672-686 (2019) - 2017
- [c7]Jean-Guillaume Fages, Charles Prud'homme:
Making the First Solution Good! ICTAI 2017: 1073-1077 - 2016
- [j4]Jean-Guillaume Fages, Xavier Lorca, Louis-Martin Rousseau:
The salesman and the tree: the importance of search in CP. Constraints An Int. J. 21(2): 145-162 (2016) - 2015
- [j3]Hadrien Cambazard, Jean-Guillaume Fages:
New filtering for AtMostNValue and its weighted variant: A Lagrangian approach. Constraints An Int. J. 20(3): 362-380 (2015) - [j2]Jean-Guillaume Fages:
On the use of graphs within constraint-programming. Constraints An Int. J. 20(4): 498-499 (2015) - [c6]Andrés Felipe Barco Santa, Élise Vareilles, Paul Gaborit, Jean-Guillaume Fages, Michel Aldanondo:
Coupling two constraint-based systems into an on-line facade-layout configurator. Configuration Workshop 2015: 47-54 - [c5]Alban Derrien, Jean-Guillaume Fages, Thierry Petit, Charles Prud'homme:
A Global Constraint for a Tractable Class of Temporal Optimization Problems. CP 2015: 105-120 - [c4]Andrés Felipe Barco, Jean-Guillaume Fages, Élise Vareilles, Michel Aldanondo, Paul Gaborit:
Open Packing for Facade-Layout Synthesis Under a General Purpose Solver. CP 2015: 508-523 - 2014
- [b1]Jean-Guillaume Fages:
Exploitation de structures de graphe en programmation par contraintes. (On the use of graphs within constraint-programming). École des mines de Nantes, France, 2014 - [j1]Jean-Guillaume Fages, Tanguy Lapègue:
Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem. Artif. Intell. 212: 116-133 (2014) - [c3]Jean-Guillaume Fages, Xavier Lorca, Thierry Petit:
Self-decomposable Global Constraints. ECAI 2014: 297-302 - [i2]Jean-Guillaume Fages, Gilles Chabert, Charles Prud'homme:
Combining finite and continuous solvers. CoRR abs/1402.1361 (2014) - 2013
- [c2]Jean-Guillaume Fages, Tanguy Lapègue:
Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem. CP 2013: 63-79 - 2012
- [i1]Jean-Guillaume Fages, Xavier Lorca:
Improving the Asymmetric TSP by Considering Graph Structure. CoRR abs/1206.3437 (2012) - 2011
- [c1]Jean-Guillaume Fages, Xavier Lorca:
Revisiting the tree Constraint. CP 2011: 271-285
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:03 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:
