Bertrand Neveu

Expert Syst. Appl., 2022

2021

Learning and focusing strategies to improve ACO that solves CSP.

[BibT_eX]

[DOI]

Nicolás Rojas-Morales

Eng. Appl. Artif. Intell., 2021

An Interval Constraint Programming Approach for Quasi Capture Tube Validation.

[BibT_eX]

[DOI]

Abderahmane Bedouhene

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

A Hyper-Heuristic for the Orienteering Problem With Hotel Selection.

[BibT_eX]

[DOI]

Alan Toledo

IEEE Access, 2020

Towards a Generic Interval Solver for Differential-Algebraic CSP.

[BibT_eX]

[DOI]

Simon Rohou

Abderahmane Bedouhene

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

A generic interval branch and bound algorithm for parameter estimation.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

2018

lsmear: a variable selection strategy for interval branch and bound solvers.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

Feasibility and Availability Based Heuristics for ACO Algorithms Solving Binary CSP.

[BibT_eX]

[DOI]

Nicolás Rojas-Morales

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2016

Node selection strategies in interval Branch and Bound algorithms.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

RASON: A new approach to the scheduling radiotherapy problem that considers the current waiting times.

[BibT_eX]

[DOI]

Juan Pablo Cares

Expert Syst. Appl., 2016

GeneRa: A problem generator for radiotherapy treatment scheduling problems.

[BibT_eX]

[DOI]

Juan Pablo Cares

Ann. Math. Artif. Intell., 2016

2015

Adaptive constructive interval disjunction: algorithms and experiments.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

Improving a Constraint Programming Approach for Parameter Estimation.

[BibT_eX]

[DOI]

Martin de La Gorce

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

2014

Upper bounding in inner regions for global optimization under inequality constraints.

[BibT_eX]

[DOI]

J. Glob. Optim., 2014

A beginner's guide to tuning methods.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2014

GeneRa: A Benchmarks Generator of Radiotherapy Treatment Scheduling Problem.

[BibT_eX]

[DOI]

Juan Pablo Cares

Proceedings of the Learning and Intelligent Optimization, 2014

2013

Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2013

Adaptive Constructive Interval Disjunction.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012

Computing solutions of the paintshop-necklace problem.

[BibT_eX]

[DOI]

Frédéric Meunier

Comput. Oper. Res., 2012

An interval extension based on occurrence grouping.

[BibT_eX]

[DOI]

Computing, 2012

A Contractor Based on Convex Interval Taylor.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011

Inner Regions and Interval Linearizations for Global Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2010

Improving inter-block backtracking with interval Newton.

[BibT_eX]

[DOI]

Constraints An Int. J., 2010

An evaluation of off-line calibration techniques for evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

New requirements for off-line parameter calibration algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2010

Exploiting Monotonicity in Interval Constraint Propagation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

A revision of recent approaches for two-dimensional strip-packing problems.

[BibT_eX]

[DOI]

Xavier Bonnaire

Eng. Appl. Artif. Intell., 2009

Filtering Numerical CSPs Using Well-Constrained Subsystems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

An Efficient Hyperheuristic for Strip-Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Adaptive and Multilevel Metaheuristics, 2008

A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2008

Exploiting Common Subexpressions in Numerical CSPs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Generalized Interval Projection: A New Technique for Consistent Domain Extension.

[BibT_eX]

[DOI]

Carlos Grandón

Proceedings of the IJCAI 2007, 2007

Incremental Move for 2D Strip-Packing.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

Decomposition of Geometric Constraint Systems: a Survey.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

When Interval Analysis Helps Inter-block Backtracking.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Box-set consistency for interval-based constraint problems.

[BibT_eX]

[DOI]

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Using Constraint Programming for Solving Distance CSP with Uncertainty.

[BibT_eX]

[DOI]

Carlos Grandón

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

ID Walk: A Candidate List Strategy with a Simple Diversification Device.

[BibT_eX]

[DOI]

Fred W. Glover

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems.

[BibT_eX]

[DOI]

Christophe Jermann

Proceedings of the IJCAI-03, 2003

INCOP: An Open Library for INcomplete Combinatorial OPtimization.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

Inter-block Backtracking: Exploiting the Structure in Continuous CSPs.

[BibT_eX]

[DOI]

Christophe Jermann

Proceedings of the Global Optimization and Constraint Satisfaction, 2003

2002

Progressive Focusing Search.

[BibT_eX]

Nicolas Prcovic

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

A New Structural Rigidity for Geometric Constraint Systems.

[BibT_eX]

[DOI]

Christophe Jermann

Proceedings of the Automated Deduction in Geometry, 2002

2000

A Constraint Programming Approach for Solving Rigid Geometric Systems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2000

1999

Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search.

[BibT_eX]

[DOI]

Nicolas Prcovic

Proceedings of the Principles and Practice of Constraint Programming, 1999

1998

Using Graph Decomposition for Solving Continuous CSPs.

[BibT_eX]

[DOI]

Christian Bliek

Proceedings of the Principles and Practice of Constraint Programming, 1998

1997

Computational Complexity of Multi-way, Dataflow Constraint Problems.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Problem partition and solvers coordination in distributed constraint satisfaction.

[BibT_eX]

[DOI]

Pierre Berlandier

Proceedings of the Parallel Processing for Artificial Intelligence 3, 1997

1995

A Non-Diffident Combinatorial Optimization Algorithm.

[BibT_eX]

[DOI]

María Cristina Riff Rojas

Pierre Berlandier

Mouhssine Bouzoubaa

Proceedings of the Progress in Artificial Intelligence, 1995

1994

Maintaining Arc Consistency through Constraint Retraction.

[BibT_eX]

[DOI]