default search action
19th CPAIOR 2022: Los Angeles, CA, USA
- Pierre Schaus:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings. Lecture Notes in Computer Science 13292, Springer 2022, ISBN 978-3-031-08010-4 - Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis:
A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times. 1-13 - Gennaro Auricchio, Luca Ferrarini, Stefano Gualandi, Greta Lanzarotto, Ludovico Pernazza:
A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons. 14-23 - Timo Berthold, Gregor Hendel, Domenico Salvagnin:
Transferring Information Across Restarts in MIP. 24-33 - Sidhant Bhavnani, Alexander Schiendorfer:
Towards Copeland Optimization in Combinatorial Problems. 34-43 - Hendrik Bierlee, Graeme Gange, Guido Tack, Jip J. Dekker, Peter J. Stuckey:
Coupling Different Integer Encodings for SAT. 44-63 - Ignace Bleukx, Senne Berden, Lize Coenen, Nicholas Decleyre, Tias Guns:
Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions. 64-73 - Justin J. Boutilier, Carla Michini, Zachary Zhou:
Shattering Inequalities for Learning Optimal Decision Trees. 74-90 - Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue:
Learning Pseudo-Backdoors for Mixed Integer Programs. 91-102 - Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists. 103-119 - Marc Geitz, Cristian Grozea, Wolfgang Steigerwald, Robin Stöhr, Armin Wolf:
Solving the Extended Job Shop Scheduling Problem with AGVs - Classical and Quantum Approaches. 120-137 - John N. Hooker:
Stochastic Decision Diagrams. 138-154 - Nicolas Isoart, Jean-Charles Régin:
Improving the Robustness of EPS to Solve the TSP. 155-172 - Victor Jung, Jean-Charles Régin:
Efficient Operations Between MDDs and Constraints. 173-189 - Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho, Max Welling:
Deep Policy Dynamic Programming for Vehicle Routing Problems. 190-213 - Petr Kucera:
Learning a Propagation Complete Formula. 214-231 - Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
A FastMap-Based Algorithm for Block Modeling. 232-248 - Yiqing L. Luo, J. Christopher Beck:
Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem. 249-265 - Steve Malalel, Victor Jung, Jean-Charles Régin, Marie Pelleau:
Dealing with the Product Constraint. 266-281 - Pierre Montalbano, Simon de Givry, George Katsirelos:
Multiple-choice Knapsack Constraint in Graphical Models. 282-299 - Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber:
A Learning Large Neighborhood Search for the Staff Rerostering Problem. 300-317 - Yanick Ouellet, Claude-Guy Quimper:
A MinCumulative Resource Constraint. 318-334 - Gilles Pesant, Claude-Guy Quimper, Hélène Verhaeghe:
Practically Uniform Solution Sampling in Constraint Programming. 335-344 - Carles Roger Riera Molina, Camilo Rey, Thiago Serra, Eloi Puertas, Oriol Pujol:
Training Thinner and Deeper Neural Networks: Jumpstart Regularization. 345-357 - Mattia Silvestri, Allegra De Filippo, Federico Ruggeri, Michele Lombardi:
Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning. 358-373 - Peter J. Stuckey, Guido Tack:
Enumerated Types and Type Extensions for MiniZinc. 374-389 - Wijnand Suijlen, Félix de Framond, Arnaud Lallouet, Antoine Petitet:
A Parallel Algorithm for GAC Filtering of the Alldifferent Constraint. 390-407 - Piotr Wojciechowski, K. Subramani, Alvaro Velasquez:
Analyzing the Reachability Problem in Choice Networks. 408-423 - Jiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck:
Model-Based Approaches to Multi-attribute Diverse Matching. 424-440
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.