Zobrazeno 1 - 10
of 428
pro vyhledávání: '"Rousseau, Louis Martin"'
Lagrangian decomposition (LD) is a relaxation method that provides a dual bound for constrained optimization problems by decomposing them into more manageable sub-problems. This bound can be used in branch-and-bound algorithms to prune the search spa
Externí odkaz:
http://arxiv.org/abs/2408.12695
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
Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black-box computation. This arises in space-time dependent variants of the
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
Publikováno v:
28th International Conference on Principles and Practice of Constraint Programming (CP 2022): 235:1-235:20
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/2205.05216