With the last paper presentation in the program. Luca Begnardi presents their work on algorithmic configuration in sequential decision-making.
doi.org/10.1007/978-...

After years in the works, it has finally been published, and we can hear Scott Sanner present his work "Bounded-Error Policy Optimization for Mixed Discrete-Continuous MDPs via Constraint Generation in Nonlinear Programming"
doi.org/10.1007/978-...

The next presentation comments on the efficiency of algebraic simplex algorithms for solving MDPs and is presented by Dibyangshu Mukherjee.
doi.org/10.1007/978-...

Transitioning us into power systems, Rosemary Barrass talks about how quantum computing can be leveraged for accelerating classical algorithms in optimizing power systems.
doi.org/10.1007/978-...

From the ground to the sky, Ida Gjergji talks about their method combining constraint programming and meta-heuristics for aircraft maintenance routing with a distribution objective.
doi.org/10.1007/978-...

We continue with Emma Legrand, who won student best paper award. She presents their work on dynamic programming for the job sequencing and tool switching problem. Congratulations Emma and her co-authors Vianney Copp, Daniele Catanzaro, and Pierre Schaus!
doi.org/10.1007/978-...

In the unenviable position of last before lunch, Adolfo R. Escobedo discusses the edge-based contiguous p-median problem with connections to logistics districting.

We finish the session with two extended abstract talks. First up is Kelvin Davis to explain how we can get "better food faster" or alternatively: "A Simplified Model for Marker-Assisted Gene Pyramiding: Minimising Generations and Crossings"

We continue with Emma Legrand, who won student best paper award. She presents their work on dynamic programming for the job sequencing and tool switching problem. Congratulations Emma and her co-authors Vianney Copp, Daniele Catanzaro, and Pierre Schaus!
doi.org/10.1007/978-...

We continue with a presentation by Ramiz Gindullin who discusses their paper "Minimising Source-Plate Swaps for Robotised Compound Dispensing in Microplates"
doi.org/10.1007/978-...

Gaetano Signorelli gives the final presentation of the day. Their work tackles constrained machine learning through hyperspherical representation.
doi.org/10.1007/978-...

We continue with Mark Turner's talk on the PySCIPOpt-ML framekwork, which allows you to embed trained machine learning models into mixed-integer programs.
doi.org/10.1007/978-...

The second talk in the session titled "Multi-task Representation Learning for Mixed Integer Linear Programming" won the best paper award. Congratulations to Junyang Cai, Taoan Huang, and Bistra Dilkina!
doi.org/10.1007/978-...

The second talk in the session titled "Multi-task Representation Learning for Mixed Integer Linear Programming" won the best paper award. Congratulations to Junyang Cai, Taoan Huang, and Bistra Dilkina!
doi.org/10.1007/978-...

The final talk in the session is by Andrea Balogh who teaches us about partial knowledge compilation and how they can determine the most promising selective backbone size.
doi.org/10.1007/978-...

Alexander Hoen guides us into the space of mixed integer programming and talks about analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming.
doi.org/10.1007/978-...

Transitioning from SAT into lazy clause generation, Toby O. Davies talks about how lazy clause generation solvers can be parallelized with trail sharing.
doi.org/10.1007/978-...