Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Jean-Charles Régin"'
Autor:
Pierre Schaus, Jean-Charles Régin
Publikováno v:
EURO Journal on Computational Optimization, Vol 2, Iss 3, Pp 123-146 (2014)
Given a vector of finite domain variables, the spread constraint aims at minimizing the sum of squares of these variables while constraining the sum of these to be equal to a given value. We improve the existing filtering for spread achieving a bound
Externí odkaz:
https://doaj.org/article/a216cc33597c4e4d8728a16350fe346c
Autor:
Nicolas Isoart, Jean-Charles Régin
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783031080104
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40fe02a76b64c1f2a4f8482535e693e
https://doi.org/10.1007/978-3-031-08011-1_12
https://doi.org/10.1007/978-3-031-08011-1_12
Autor:
Victor Jung, Jean-Charles Régin
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783031080104
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::574002bd93673ff69390f172797c3ac1
https://doi.org/10.1007/978-3-031-08011-1_13
https://doi.org/10.1007/978-3-031-08011-1_13
Publikováno v:
Mathematical Programming. 182:445-464
We propose in this paper a new method processing the projection of an arbitrary size vector onto the probabilistic simplex or the $$\ell _1$$ ball. Our method merges two principles. The first one is an original search of the projection using a bucket
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030782290
CPAIOR
CPAIOR
Discrete dynamical systems (DDS) are a model to represent complex phenomena appearing in many different domains. In the finite case, they can be identified with a particular class of graphs called dynamics graphs. In [9] polynomial equations over dyn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02d4dbf7b78d3da20a038b5bc9c65356
https://doi.org/10.1007/978-3-030-78230-6_13
https://doi.org/10.1007/978-3-030-78230-6_13
Autor:
Jean-Charles Régin, Arthur Finkelstein
Publikováno v:
ICORES
SCITEPRESS Digital Library
SCITEPRESS Digital Library, In press
SCITEPRESS Digital Library
SCITEPRESS Digital Library, In press
International audience; One of the main problems for a realistic journey planning in public transit is the need to give the user multiple qualitative choices. Usually, public transit journeys involve 4 main criteria: the departure time, the arrival t
Autor:
Nicolas Isoart, Jean-Charles Régin
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp.300-316, 2020, ⟨10.1007/978-3-030-58942-4_20⟩
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp.300-316, 2020, ⟨10.1007/978-3-030-58942-4_20⟩
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
M. Sellmann showed that CP-based Lagrangian relaxation gave good results but the interactions between the filtering algorithms and the Lagrangian multipliers were quite difficult to understand. In other words, it is difficult to determine when filter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b594e9cd0b07d985de25c39691f9b36
https://hal.archives-ouvertes.fr/hal-02969585
https://hal.archives-ouvertes.fr/hal-02969585
Autor:
Nicolas Isoart, Jean-Charles Régin
Publikováno v:
International Conference on Principles and Practice of Constraint Programming
International Conference on Principles and Practice of Constraint Programming, pp.410-426, 2020, ⟨10.1007/978-3-030-58475-7_24⟩
Lecture Notes in Computer Science ISBN: 9783030584740
CP
International Conference on Principles and Practice of Constraint Programming, pp.410-426, 2020, ⟨10.1007/978-3-030-58475-7_24⟩
Lecture Notes in Computer Science ISBN: 9783030584740
CP
The currently best CP method for solving the Travelling Salesman Problem is the Weighted Circuit Constraint associated with the LCFirst search strategy. The use of Embarrassingly Parallel Search (EPS) for this model is problematic because EPS decompo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cd448151f1c78b7a99ca00cf6a0e314
https://hal.archives-ouvertes.fr/hal-02969580
https://hal.archives-ouvertes.fr/hal-02969580
Autor:
Guillaume Perez, Jean-Charles Régin
Publikováno v:
AAAI 2018 Conference | The Thirty-Second AAAI Conference on Artificial Intelligence
AAAI 2018 Conference | The Thirty-Second AAAI Conference on Artificial Intelligence, Feb 2018, New Orleans, France
AAAI 2018 Conference | The Thirty-Second AAAI Conference on Artificial Intelligence, Feb 2018, New Orleans, France
Multi-valued Decision Diagrams (MDDs) have been extensively studied in the last ten years. Recently, efficient algorithms implementing operators such as reduction, union, intersection, difference, etc., have been designed. They directly deal with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::187a4d8b1ff530f4e3221dfcbddb1293
https://hal.archives-ouvertes.fr/hal-01877882/document
https://hal.archives-ouvertes.fr/hal-01877882/document
Autor:
Arnaud Malapert, Jean-Charles Régin
Publikováno v:
Handbook of Parallel Constraint Reasoning ISBN: 9783319635156
Handbook of Parallel Constraint Reasoning
Handbook of Parallel Constraint Reasoning
Constraint programming (CP) is an efficient technique for solving combinatorial optimization problems. In CP a problem is defined over variables that take values in domains and constraints which restrict the allowed combination of values. CP uses for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ec4d11135ca8d7e09039744b65265a8
https://doi.org/10.1007/978-3-319-63516-3_9
https://doi.org/10.1007/978-3-319-63516-3_9