default search action
Narendra Jussien
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [i1]Charles Prud'homme, Xavier Lorca
, Narendra Jussien:
Event Selection Rules to Compute Explanations. CoRR abs/1608.08015 (2016) - 2014
- [j15]Charles Prud'homme
Propagation engine prototyping with a domain specific language. Constraints An Int. J. 19(1): 57-76 (2014) - [j14]Charles Prud'homme
Explanation-based large neighborhood search. Constraints An Int. J. 19(4): 339-379 (2014) - 2013
- [c31]Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau:
An Optimal Constraint Programming Approach to the Open-Shop Problem. ICAPS 2013 - 2012
- [j13]Arnaud Malapert, Hadrien Cambazard, Christelle Guéret
An Optimal Constraint Programming Approach to the Open-Shop Problem. INFORMS J. Comput. 24(2): 228-244 (2012) - [e1]Nicolas Beldiceanu, Narendra Jussien, Eric Pinson:
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings. Lecture Notes in Computer Science 7298, Springer 2012, ISBN 978-3-642-29827-1 [contents] - 2011
- [c30]Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien:
Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource. CP 2011: 240-255
2000 – 2009
- 2009
- [c29]Julien Vion, Thierry Petit, Narendra Jussien:
Integrating Strong Local Consistencies into Constraint Solvers. CSCLP 2009: 90-104 - 2008
- [j12]Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Déplanche, Narendra Jussien:
Solving a real-time allocation problem with constraint programming. J. Syst. Softw. 81(1): 132-149 (2008) - 2007
- [c28]Hadrien Cambazard, Narendra Jussien:
Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques. ExaCt 2007: 14-19 - [c27]Hadrien Cambazard, Narendra Jussien:
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. LION 2007: 69-80 - 2006
- [j11]Hadrien Cambazard, Narendra Jussien:
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. Constraints An Int. J. 11(4): 295-313 (2006) - [j10]François Fages, Narendra Jussien, Christine Solnon:
Editorial. RAIRO Oper. Res. 40(4): 325-326 (2006) - [j9]Hadrien Cambazard, Narendra Jussien:
Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire. RAIRO Oper. Res. 40(4): 381-401 (2006) - 2005
- [j8]Gérard Verfaillie, Narendra Jussien:
Constraint Solving in Uncertain and Dynamic Environments: A Survey. Constraints An Int. J. 10(3): 253-281 (2005) - [c26]Hadrien Cambazard, Narendra Jussien:
Integrating Benders Decomposition Within Constraint Programming. CP 2005: 752-756 - [c25]Hadrien Cambazard, Narendra Jussien:
Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. CPAIOR 2005: 94-109 - [c24]Mohammad Ghoniem
Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming. SOFTVIS 2005: 27-36 - 2004
- [j7]Narendra Jussien, François Laburthe:
Foreword. Ann. Oper. Res. 130(1-4): 17-18 (2004) - [c23]Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Marie Déplanche, Narendra Jussien, Yvon Trinquet:
Decomposition and Learning for a Hard Real Time Task Allocation Problem. CP 2004: 153-167 - [c22]Mohammad Ghoniem, Narendra Jussien, Jean-Daniel Fekete:
VISEXP: Visualizing Constraint Solver Dynamics Using Explanations. FLAIRS 2004: 263-268 - [c21]Hadrien Cambazard, Fabien Demazeau, Narendra Jussien, Philippe David:
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming. PATAT 2004: 190-207 - 2003
- [b2]Narendra Jussien:
The versatility of using explanations within constraint programming. University of Nantes, France, 2003 - [j6]Christelle Guéret
Loading aircraft for military operations. J. Oper. Res. Soc. 54(5): 458-465 (2003) - [j5]Narendra Jussien:
L'enseignement de la programmation logique à l'École des Mines de Nantes. Tech. Sci. Informatiques 22(1): 63-75 (2003) - [j4]Patrice Boizumault, Narendra Jussien, Samir Ouis:
Explications k-relevantes pour la programmation par contraintes. Tech. Sci. Informatiques 22(1): 111-124 (2003) - [c20]Romuald Debruyne, Gérard Ferrand, Narendra Jussien, Willy Lesaint, Samir Ouis, Alexandre Tessier:
Correctness of Constraint Retraction Algorithms. FLAIRS 2003: 172-176 - [c19]Samir Ouis, Narendra Jussien, Patrice Boizumault:
k-relevant Explanations for Constraint Programming. FLAIRS 2003: 192-196 - [c18]Narendra Jussien:
L'enseignement de la programmation logique à l'Ecole des Mines de Nantes. JFPLC 2003: 63-75 - [c17]Samir Ouis, Narendra Jussien, Patrice Boizumault:
Explications k-relevantes pour la programmation par contraintes. JFPLC 2003: 111-124 - 2002
- [j3]Narendra Jussien, Olivier Lhomme:
Local search with constraint propagation and conflict-based heuristics. Artif. Intell. 139(1): 21-45 (2002) - [c16]Abdallah Elkhyari, Christelle Guéret
Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems. CP 2002: 702-707 - [c15]Samir Ouis, Narendra Jussien, Olivier Lhomme:
Explications conviviales pour la programmation par contraintes. JFPLC 2002: 105- - [c14]Yann-Gaël Guéhéneuc, Rémi Douence, Narendra Jussien:
No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs. ASE 2002: 117- - [c13]Samir Ouis, Narendra Jussien, Patrice Boizumault:
COINS: a constraint-based interactive solving system. WLPE 2002: 31-46 - [c12]Abdallah Elkhyari, Christelle Guéret
Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools. PATAT 2002: 39-62 - 2001
- [c11]Hervé Albin-Amiot, Pierre Cointe, Yann-Gaël Guéhéneuc, Narendra Jussien:
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together. ASE 2001: 166-173 - [c10]Narendra Jussien, Samir Ouis:
User-friendly explanations for constraint programming. WLPE 2001 - 2000
- [j2]Narendra Jussien, Olivier Lhomme:
The Path repair algorithm. Electron. Notes Discret. Math. 4: 2-16 (2000) - [j1]Christelle Guéret
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems. Eur. J. Oper. Res. 127(2): 344-354 (2000) - [c9]Narendra Jussien, Olivier Lhomme:
Local Search with Constraint Propagation and Conflict-Based Heuristics. AAAI/IAAI 2000: 169-174 - [c8]Narendra Jussien, Romuald Debruyne, Patrice Boizumault:
Maintaining Arc-Consistency within Dynamic Backtracking. CP 2000: 249-261
1990 – 1999
- 1998
- [c7]Narendra Jussien, Olivier Lhomme:
Dynamic Domain Splitting for Numeric CSPs. ECAI 1998: 224-228 - [c6]Narendra Jussien, Christelle Guéret:
Utilisation du backtrack intelligent dans un branch-and-bound. Application au problème d'Open-Shop. JFPLC 1998: 231-250 - 1997
- [b1]Narendra Jussien:
Relaxation de Contraintes pour les problèmes dynamiques. (Constraint relaxation for dynamic problems). University of Rennes 1, France, 1997 - [c5]Narendra Jussien, Patrice Boizumault:
Stratégies en meilleur d'abord pour la relaxation de contraintes. JFPLC 1997: 149- - [c4]Narendra Jussien, Patrice Boizumault:
Best-First Search for Property Maintenance in Reactive Constraint Systems. ILPS 1997: 339-353 - 1996
- [c3]Narendra Jussien, Patrice Boizumault:
Maintien de déduction pour la relaxation de contraintes. JFPLC 1996: 239-254 - 1995
- [c2]Narendra Jussien, Patrice Boizumault:
Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems. Over-Constrained Systems 1995: 265-280 - [c1]Christelle Guéret
Building University Timetables Using Constraint Logic Programming. PATAT 1995: 130-145
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-25 05:49 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: