Abstract is missing.
- A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation TimesEddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis. 1-13 [doi]
- A SAT Encoding to Compute Aperiodic Tiling Rhythmic CanonsGennaro Auricchio, Luca Ferrarini, Stefano Gualandi, Greta Lanzarotto, Ludovico Pernazza. 14-23 [doi]
- Transferring Information Across Restarts in MIPTimo Berthold, Gregor Hendel, Domenico Salvagnin. 24-33 [doi]
- Towards Copeland Optimization in Combinatorial ProblemsSidhant Bhavnani, Alexander Schiendorfer. 34-43 [doi]
- Coupling Different Integer Encodings for SATHendrik Bierlee, Graeme Gange, Guido Tack, Jip J. Dekker, Peter J. Stuckey. 44-63 [doi]
- Model-Based Algorithm Configuration with Adaptive Capping and Prior DistributionsIgnace Bleukx, Senne Berden, Lize Coenen, Nicholas Decleyre, Tias Guns. 64-73 [doi]
- Shattering Inequalities for Learning Optimal Decision TreesJustin J. Boutilier, Carla Michini, Zachary Zhou. 74-90 [doi]
- Learning Pseudo-Backdoors for Mixed Integer ProgramsAaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue. 91-102 [doi]
- Leveraging Integer Linear Programming to Learn Optimal Fair Rule ListsUlrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala 0002. 103-119 [doi]
- Solving the Extended Job Shop Scheduling Problem with AGVs - Classical and Quantum ApproachesMarc Geitz, Cristian Grozea, Wolfgang Steigerwald, Robin Stöhr, Armin Wolf. 120-137 [doi]
- Stochastic Decision DiagramsJohn N. Hooker. 138-154 [doi]
- Improving the Robustness of EPS to Solve the TSPNicolas Isoart, Jean-Charles Régin. 155-172 [doi]
- Efficient Operations Between MDDs and ConstraintsVictor Jung, Jean-Charles Régin. 173-189 [doi]
- Deep Policy Dynamic Programming for Vehicle Routing ProblemsWouter Kool 0001, Herke van Hoof, Joaquim A. S. Gromicho, Max Welling. 190-213 [doi]
- Learning a Propagation Complete FormulaPetr Kucera. 214-231 [doi]
- A FastMap-Based Algorithm for Block ModelingAng Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar. 232-248 [doi]
- Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock ProblemYiqing L. Luo, J. Christopher Beck. 249-265 [doi]
- Dealing with the Product ConstraintSteve Malalel, Victor Jung, Jean-Charles Régin, Marie Pelleau. 266-281 [doi]
- Multiple-choice Knapsack Constraint in Graphical ModelsPierre Montalbano, Simon de Givry, George Katsirelos. 282-299 [doi]
- A Learning Large Neighborhood Search for the Staff Rerostering ProblemFabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber. 300-317 [doi]
- A MinCumulative Resource ConstraintYanick Ouellet, Claude-Guy Quimper. 318-334 [doi]
- Practically Uniform Solution Sampling in Constraint ProgrammingGilles Pesant, Claude-Guy Quimper, Hélène Verhaeghe. 335-344 [doi]
- Training Thinner and Deeper Neural Networks: Jumpstart RegularizationCarles Roger Riera Molina, Camilo Rey, Thiago Serra, Eloi Puertas, Oriol Pujol. 345-357 [doi]
- Hybrid Offline/Online Optimization for Energy Management via Reinforcement LearningMattia Silvestri, Allegra De Filippo, Federico Ruggeri, Michele Lombardi 0001. 358-373 [doi]
- Enumerated Types and Type Extensions for MiniZincPeter J. Stuckey, Guido Tack. 374-389 [doi]
- A Parallel Algorithm for GAC Filtering of the Alldifferent ConstraintWijnand Suijlen, Félix de Framond, Arnaud Lallouet, Antoine Petitet. 390-407 [doi]
- Analyzing the Reachability Problem in Choice NetworksPiotr J. Wojciechowski, K. Subramani, Alvaro Velasquez. 408-423 [doi]
- Model-Based Approaches to Multi-attribute Diverse MatchingJiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck. 424-440 [doi]