Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Gilles Pesant"'
Autor:
Gilles Pesant
Publikováno v:
EURO Journal on Computational Optimization, Vol 2, Iss 3, Pp 89-97 (2014)
The purpose of this short paper is to give a reader acquainted with combinatorial optimization enough background in Constraint Programming to appreciate the other papers in this special issue. We will cover modeling, inference, and search. Whenever a
Externí odkaz:
https://doaj.org/article/e19d9cce09c24b1b96af5378c2d1e6dc
Autor:
Auguste Burlats, Gilles Pesant
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783031332708
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2a18fb79f2adbeb369ee5451f02f46
https://doi.org/10.1007/978-3-031-33271-5_21
https://doi.org/10.1007/978-3-031-33271-5_21
Autor:
Gauthier Pezzoli, Gilles Pesant
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783031332708
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff23350003174c265c9512d26e914ab2
https://doi.org/10.1007/978-3-031-33271-5_24
https://doi.org/10.1007/978-3-031-33271-5_24
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:2-10
The combinatorial problems that constraint programming typically solves belong to the class of NP-hard problems. The AI planning community focuses on even harder problems: for example, classical planning is PSPACE-hard. A natural and well-known const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a22a6e27da1d717e280b0f11e3da970
https://doi.org/10.1609/socs.v11i1.18529
https://doi.org/10.1609/socs.v11i1.18529
Publikováno v:
INFORMS Journal on Computing. 33:949-962
The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities with profits being associated with pairs of items packed into the same knapsack. This problem has been solved by various he
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03e132930345dae7ce4414747bf2e27f
https://doi.org/10.1287/ijoc.2020.0983
https://doi.org/10.1287/ijoc.2020.0983
Publikováno v:
4OR. 20:391-415
The concept of balance plays an important role in many combinatorial optimization problems. Yet there exist various ways of expressing balance, and it is not always obvious how best to achieve it. In this methodology-focused paper, we study three cas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f2ab80b33dbeb1cac6780ab117861e3
https://doi.org/10.1007/s10288-021-00486-x
https://doi.org/10.1007/s10288-021-00486-x
Publikováno v:
MIT web domain
This paper addresses a class of two-stage robust optimization models with an exponential number of scenarios given implicitly. We apply Dantzig–Wolfe decomposition to exploit the structure of these models and show that the original problem reduces
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dc763b8d2448617cd08ee001fb5405
https://doi.org/10.1287/ijoc.2019.0928
https://doi.org/10.1287/ijoc.2019.0928
Autor:
Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret
Publikováno v:
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research, 2022
Web of Science
Journal of Artificial Intelligence Research, 2022
Web of Science
International audience; The Business-to-Business Meeting Scheduling problem consists of scheduling a set of meetings between given pairs of participants to an event, while taking into account participants' availability and accommodation capacity. A c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f7cedbe037560e1db6535f828d9f0a4
https://hal-amu.archives-ouvertes.fr/hal-03775300
https://hal-amu.archives-ouvertes.fr/hal-03775300
Publikováno v:
Transportation Science. 54:1053-1072
This paper, for the first time, studies vehicle routing problems with synchronized visits (VRPS) and stochastic travel and service times. In addition to considering a home healthcare scheduling problem, we introduce an operating room scheduling probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef15bdcb40a5a30f87497b65820fd204
https://doi.org/10.1287/trsc.2019.0956
https://doi.org/10.1287/trsc.2019.0956
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 88:907-949
A wide range of important problems in machine learning, expert system, social network analysis, bioinformatics and information theory can be formulated as a maximum a-posteriori (MAP) inference problem on statistical relational models. While off-the-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfd4e5793f854381c96f3e644935c0ab
https://doi.org/10.1007/s10472-020-09698-z
https://doi.org/10.1007/s10472-020-09698-z