Zobrazeno 1 - 10
of 1 760
pro vyhledávání: '"Louis, Martin"'
This paper introduces a novel compact mixed integer linear programming (MILP) formulation and a discretization discovery-based solution approach for the Vehicle Routing Problem with Time Windows (VRPTW). We aim to solve the optimization problem effic
Externí odkaz:
http://arxiv.org/abs/2403.00262
Lagrangian relaxation is a versatile mathematical technique employed to relax constraints in an optimization problem, enabling the generation of dual bounds to prove the optimality of feasible solutions and the design of efficient propagators in cons
Externí odkaz:
http://arxiv.org/abs/2312.14836
Due to uncertainty in demand, sometimes management may delay their planning of shifts later in the horizon when they have more information. We consider a novel dynamic and flexible system for scheduling personnel for work shifts planned at the last m
Externí odkaz:
http://arxiv.org/abs/2312.06139
Autor:
Rudich, Isaac, Cappart, Quentin, López-Ibáñez, Manuel, Römer, Michael, Rousseau, Louis-Martin
The Asteroid Routing Problem is like the Traveling Salesman Problem, but in space. The European Space Agency is interested in visiting asteroids to extract minerals, however, the asteroids are moving, and calculating trajectories between asteroids ca
Externí odkaz:
http://arxiv.org/abs/2312.01404
In this research we consider the problem of accelerating the convergence of column generation (CG) for the weighted set cover formulation of the capacitated vehicle routing problem with time windows (CVRPTW). We adapt two new techniques, Local Area (
Externí odkaz:
http://arxiv.org/abs/2304.11723
Publikováno v:
Journal of Artificial Intelligence Research, 77:1489-1538 (2023)
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still incorporating the library of techniques that conventional solvers have had
Externí odkaz:
http://arxiv.org/abs/2302.05483
Autor:
Marty, Tom, François, Tristan, Tessier, Pierre, Gauthier, Louis, Rousseau, Louis-Martin, Cappart, Quentin
Publikováno v:
Constraint Programming 29 (2023) 25:1--25:19
Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are designed to lead the search to the best solutions in a minimum amount of
Externí odkaz:
http://arxiv.org/abs/2301.01913
Autor:
Claudia Calderon Ramirez, Yanick Farmer, Andrea Frolic, Gina Bravo, Nathalie Orr Gaucher, Antoine Payot, Lucie Opatrny, Diane Poirier, Joseph Dahine, Audrey L’Espérance, James Downar, Peter Tanuseputro, Louis-Martin Rousseau, Vincent Dumez, Annie Descôteaux, Clara Dallaire, Karell Laporte, Marie-Eve Bouthillier
Publikováno v:
BMC Medical Ethics, Vol 25, Iss 1, Pp 1-14 (2024)
Abstract Background The prioritization protocols for accessing adult critical care in the extreme pandemic context contain tiebreaker criteria to facilitate decision-making in the allocation of resources between patients with a similar survival progn
Externí odkaz:
https://doaj.org/article/fe5fd844e67340678401d850c7ad8f28
Autor:
Yannick Louis MARTIN
Publikováno v:
Brain: Broad Research in Artificial Intelligence and Neuroscience, Vol 15, Iss 1, Pp 171-192 (2024)
In recent years, there has been growing recognition of the significant impact of psychological and emotional injuries on the lives of individuals who have experienced physical trauma. The importance of psychiatric involvement in determining the exten
Externí odkaz:
https://doaj.org/article/7cacee6d069f4ec7944ebc419539469f