default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand Neveu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Javier Maldonado
, María Cristina Riff, Bertrand Neveu:
A review of recent approaches on wrapper feature selection for intrusion detection. Expert Syst. Appl. 198: 116822 (2022)- 2021
- [j18]Nicolás Rojas-Morales, María Cristina Riff, Bertrand Neveu:
Learning and focusing strategies to improve ACO that solves CSP. Eng. Appl. Artif. Intell. 105: 104408 (2021) - [c32]Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stéphane Le Ménec:
An Interval Constraint Programming Approach for Quasi Capture Tube Validation. CP 2021: 18:1-18:17 - 2020
- [j17]Alan Toledo, María Cristina Riff, Bertrand Neveu:
A Hyper-Heuristic for the Orienteering Problem With Hotel Selection. IEEE Access 8: 1303-1313 (2020) - [c31]Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni:
Towards a Generic Interval Solver for Differential-Algebraic CSP. CP 2020: 548-565
2010 – 2019
- 2019
- [j16]Bertrand Neveu, Martin de La Gorce, Pascal Monasse, Gilles Trombettoni:
A generic interval branch and bound algorithm for parameter estimation. J. Glob. Optim. 73(3): 515-535 (2019) - 2018
- [j15]Ignacio Araya, Bertrand Neveu:
lsmear: a variable selection strategy for interval branch and bound solvers. J. Glob. Optim. 71(3): 483-500 (2018) - [c30]Nicolás Rojas-Morales, María Cristina Riff, Bertrand Neveu:
Feasibility and Availability Based Heuristics for ACO Algorithms Solving Binary CSP. CEC 2018: 1-8 - 2016
- [j14]Juan Pablo Cares, María Cristina Riff, Bertrand Neveu:
GeneRa: A problem generator for radiotherapy treatment scheduling problems. Ann. Math. Artif. Intell. 76(1-2): 191-214 (2016) - [j13]María Cristina Riff, Juan Pablo Cares, Bertrand Neveu:
RASON: A new approach to the scheduling radiotherapy problem that considers the current waiting times. Expert Syst. Appl. 64: 287-295 (2016) - [j12]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Node selection strategies in interval Branch and Bound algorithms. J. Glob. Optim. 64(2): 289-304 (2016) - 2015
- [j11]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Adaptive constructive interval disjunction: algorithms and experiments. Constraints An Int. J. 20(4): 452-467 (2015) - [c29]Bertrand Neveu, Martin de La Gorce, Gilles Trombettoni:
Improving a Constraint Programming Approach for Parameter Estimation. ICTAI 2015: 852-859 - 2014
- [j10]Elizabeth Montero, María Cristina Riff, Bertrand Neveu:
A beginner's guide to tuning methods. Appl. Soft Comput. 17: 39-51 (2014) - [j9]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu, Gilles Chabert:
Upper bounding in inner regions for global optimization under inequality constraints. J. Glob. Optim. 60(2): 145-164 (2014) - [c28]Juan Pablo Cares, María Cristina Riff, Bertrand Neveu:
GeneRa: A Benchmarks Generator of Radiotherapy Treatment Scheduling Problem. LION 2014: 353-361 - 2013
- [j8]María Cristina Riff, Elizabeth Montero, Bertrand Neveu:
Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach. Knowl. Based Syst. 41: 54-67 (2013) - [c27]Bertrand Neveu, Gilles Trombettoni:
Adaptive Constructive Interval Disjunction. ICTAI 2013: 900-906 - 2012
- [j7]Ignacio Araya, Bertrand Neveu, Gilles Trombettoni:
An interval extension based on occurrence grouping. Computing 94(2-4): 173-188 (2012) - [j6]Frédéric Meunier, Bertrand Neveu:
Computing solutions of the paintshop-necklace problem. Comput. Oper. Res. 39(11): 2666-2678 (2012) - [c26]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
A Contractor Based on Convex Interval Taylor. CPAIOR 2012: 1-16 - 2011
- [c25]Gilles Trombettoni, Ignacio Araya, Bertrand Neveu, Gilles Chabert:
Inner Regions and Interval Linearizations for Global Optimization. AAAI 2011: 99-104 - 2010
- [j5]Bertrand Neveu, Gilles Trombettoni, Gilles Chabert:
Improving inter-block backtracking with interval Newton. Constraints An Int. J. 15(1): 93-116 (2010) - [j4]María Cristina Riff, Elizabeth Montero, Bertrand Neveu:
C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm. Trans. Comput. Sci. 8: 41-55 (2010) - [c24]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Exploiting Monotonicity in Interval Constraint Propagation. AAAI 2010: 9-14 - [c23]Elizabeth Montero, María Cristina Riff, Bertrand Neveu:
New requirements for off-line parameter calibration algorithms. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c22]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity. CP 2010: 61-68 - [c21]Elizabeth Montero, María Cristina Riff, Bertrand Neveu:
An evaluation of off-line calibration techniques for evolutionary algorithms. GECCO 2010: 299-300
2000 – 2009
- 2009
- [j3]María Cristina Riff, Xavier Bonnaire, Bertrand Neveu:
A revision of recent approaches for two-dimensional strip-packing problems. Eng. Appl. Artif. Intell. 22(4-5): 823-827 (2009) - [c20]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Filtering Numerical CSPs Using Well-Constrained Subsystems. CP 2009: 158-172 - 2008
- [j2]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya, María Cristina Riff:
A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes. Int. J. Artif. Intell. Tools 17(5): 881-901 (2008) - [c19]Ignacio Araya, Bertrand Neveu, Gilles Trombettoni:
Exploiting Common Subexpressions in Numerical CSPs. CP 2008: 342-357 - [p2]Ignacio Araya, Bertrand Neveu, María Cristina Riff:
An Efficient Hyperheuristic for Strip-Packing Problems. Adaptive and Multilevel Metaheuristics 2008: 61-76 - 2007
- [c18]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Incremental Move for 2D Strip-Packing. ICTAI (2) 2007: 489-496 - [c17]Carlos Grandón, Gilles Chabert, Bertrand Neveu:
Generalized Interval Projection: A New Technique for Consistent Domain Extension. IJCAI 2007: 94-99 - 2006
- [j1]Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, Pascal Mathis:
Decomposition of Geometric Constraint Systems: a Survey. Int. J. Comput. Geom. Appl. 16(5-6): 379-414 (2006) - [c16]Bertrand Neveu, Gilles Chabert, Gilles Trombettoni:
When Interval Analysis Helps Inter-block Backtracking. CP 2006: 390-405 - 2005
- [c15]Carlos Grandón, Bertrand Neveu:
Using Constraint Programming for Solving Distance CSP with Uncertainty. CP 2005: 847 - [c14]Gilles Chabert, Gilles Trombettoni, Bertrand Neveu:
Box-set consistency for interval-based constraint problems. SAC 2005: 1439-1443 - 2004
- [c13]Bertrand Neveu, Gilles Trombettoni, Fred W. Glover:
ID Walk: A Candidate List Strategy with a Simple Diversification Device. CP 2004: 423-437 - 2003
- [c12]Bertrand Neveu, Christophe Jermann, Gilles Trombettoni:
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs. COCOS 2003: 15-30 - [c11]Bertrand Neveu, Gilles Trombettoni:
INCOP: An Open Library for INcomplete Combinatorial OPtimization. CP 2003: 909-913 - [c10]Christophe Jermann, Bertrand Neveu, Gilles Trombettoni:
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems. IJCAI 2003: 233-238 - 2002
- [c9]Christophe Jermann, Bertrand Neveu, Gilles Trombettoni:
A New Structural Rigidity for Geometric Constraint Systems. Automated Deduction in Geometry 2002: 87-106 - [c8]Nicolas Prcovic, Bertrand Neveu:
Progressive Focusing Search. ECAI 2002: 126-130 - 2000
- [c7]Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, Michel Rueher:
A Constraint Programming Approach for Solving Rigid Geometric Systems. CP 2000: 233-248
1990 – 1999
- 1999
- [c6]Nicolas Prcovic, Bertrand Neveu:
Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search. CP 1999: 361-374 - 1998
- [c5]Christian Bliek, Bertrand Neveu, Gilles Trombettoni:
Using Graph Decomposition for Solving Continuous CSPs. CP 1998: 102-116 - 1997
- [c4]Gilles Trombettoni, Bertrand Neveu:
Computational Complexity of Multi-way, Dataflow Constraint Problems. IJCAI (1) 1997: 358-365 - [p1]Pierre Berlandier, Bertrand Neveu:
Problem partition and solvers coordination in distributed constraint satisfaction. Parallel Processing for Artificial Intelligence 3 1997: 165-178 - 1995
- [c3]Gilles Trombettoni, Bertrand Neveu, Pierre Berlandier, María Cristina Riff Rojas, Mouhssine Bouzoubaa:
A Non-Diffident Combinatorial Optimization Algorithm. EPIA 1995: 403-407 - 1994
- [c2]Bertrand Neveu, Pierre Berlandier:
Maintaining Arc Consistency through Constraint Retraction. ICTAI 1994: 426-431 - 1990
- [c1]Frédéric Allez, J. Palfart, M. P. Joubert, J. P. Labat, Olivier Corby, Bertrand Neveu:
ERASME: A Multi-Expert System for Pavement Assessment and Rehabilitation. IAAI 1990: 281-290
Coauthor Index
aka: María Cristina Riff Rojas
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 22:46 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:
