Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Pierre Le Bodic"'
Publikováno v:
European Journal of Operational Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::193d16f0afdd6e6b5455a3908adc66b9
https://doi.org/10.1016/j.ejor.2023.05.019
https://doi.org/10.1016/j.ejor.2023.05.019
Publikováno v:
INFORMS Journal on Computing. 34:934-952
This paper investigates the problem of estimating the size of branch-and-bound (B&B) trees for solving mixed-integer programs. We first prove that the size of the B&B tree cannot be approximated within a factor of 2 for general binary programs, unles
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62735cccdf8bfe90e67d69ca4e9e7f71
https://doi.org/10.1287/ijoc.2021.1103
https://doi.org/10.1287/ijoc.2021.1103
Publikováno v:
Journal of Artificial Intelligence Research. 72:1251-1279
Decision sets and decision lists are two of the most easily explainable machine learning models. Given the renewed emphasis on explainable machine learning decisions, both of these machine learning models are becoming increasingly attractive, as they
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38a1591890ce3b5e2d2b468971c6f945
https://doi.org/10.1613/jair.1.12719
https://doi.org/10.1613/jair.1.12719
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:285-287
The Euclidean Shortest Path Problem (ESPP) asks us to find a minimum length path between two points on a 2D plane while avoiding a set of polygonal obstacles. Existing approaches for ESPP, based on Dijkstra or A* search, are primal methods that gradu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b36989cc6cbac531a3802929c2ff624
https://doi.org/10.1609/socs.v15i1.21787
https://doi.org/10.1609/socs.v15i1.21787
Publikováno v:
European Journal of Operational Research. 293:1077-1096
Fuel and fuel-related expenses constitute a major part of the operating costs of railway companies. Hence, improvements in fuel management often lead to significant annual operational cost savings. The traditional approach to reduce the fueling costs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afc901c80609ecfff50f42611f39f7a6
https://doi.org/10.1016/j.ejor.2020.12.042
https://doi.org/10.1016/j.ejor.2020.12.042
Autor:
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel D. Harabor, Peter J. Stuckey, Sven Koenig
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:12241-12248
Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-Agent Path Finding (MAPF). The main step of CBS is to expand nodes by resolving conflicts (where two agents collide). Choosing the ‘right’ conflict to resolve can grea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f936f4722a71e662f5d5678de7ee6457
https://doi.org/10.1609/aaai.v35i14.17453
https://doi.org/10.1609/aaai.v35i14.17453
Autor:
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel D. Harabor, Peter J. Stuckey, Sven Koenig
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 12:213-215
Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-Agent Path Finding (MAPF). At its high level, CBS expands nodes by resolving conflicts. In recent years, admissible heuristics were added to the high level of CBS. We enha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c57396873e99ce0ada788eec90a0ba71
https://doi.org/10.1609/socs.v12i1.18587
https://doi.org/10.1609/socs.v12i1.18587
Autor:
Ryan Hechenberger, Daniel D. Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 12:176-178
The shortest path problem (SPP) asks us to find a minimum length path between two points, usually on a graph. In a Euclidean environment the points are in a 2D plane and here the path must avoid a set of polygonal obstacles. Solution methods for this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c1f98edb76fa782aa88c722d839ab18
https://doi.org/10.1609/socs.v12i1.18575
https://doi.org/10.1609/socs.v12i1.18575
Publikováno v:
Mathematical Programming. 190:811-841
A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size of the resulting search trees by orders of magnitude. A recent articl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::098726e73a6e9fb825b6df9ab265d53c
https://doi.org/10.1007/s10107-020-01556-4
https://doi.org/10.1007/s10107-020-01556-4
Autor:
Edward Lam, Pierre Le Bodic
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 30:184-192
BCP, a state-of-the-art algorithm for optimal Multi-agent Path Finding, uses the branch-and-cut-and-price framework to decompose the problem into (1) a master problem that selects a set of collision-free low-cost paths, (2) a pricing problem that add
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::957d54a4fa10b7540b2ec4989f180597
https://doi.org/10.1609/icaps.v30i1.6660
https://doi.org/10.1609/icaps.v30i1.6660