default search action
18th CPAIOR 2021: Vienna, Austria
- Peter J. Stuckey:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5-8, 2021, Proceedings. Lecture Notes in Computer Science 12735, Springer 2021, ISBN 978-3-030-78229-0 - Nikolaj S. Bjørner, Maxwell Levatich, Nuno P. Lopes
, Andrey Rybalchenko, Chandrasekar Vuppalapati:
Supercharging Plant Configurations Using Z3. 1-25 - Alessandro Hill, Jordan Ticktin
A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects. 26-44 - Emil Karlsson
Strengthening of Feasibility Cuts in Logic-Based Benders Decomposition. 45-61 - Ronald van Driel, Emir Demirovic
Learning Variable Activity Initialisation for Lazy Clause Generation Solvers. 62-71 - Matthias Horn, Günther R. Raidl:
A*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. 72-88 - Richard Hoshino, Irene Fabris:
Partitioning Students into Cohorts During COVID-19. 89-105 - Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha
A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. 106-114 - Eldan Cohen, J. Christopher Beck:
Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding. 115-132 - Christian Klanke
Combining Constraint Programming and Temporal Decomposition Approaches - Scheduling of an Industrial Formulation Plant. 133-148 - Roel Lambers
The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. 149-162 - Ikram Nekkache
Towards a Compact SAT-Based Encoding of Itemset Mining Tasks. 163-178 - Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui:
A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming. 179-195 - Enrico Formenti
MDDs Boost Equation Solving on Discrete Dynamical Systems. 196-213 - Claire Hanen
Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors. 214-230 - Xavier Gillard
Improving the Filtering of Branch-and-Bound MDD Solver. 231-247 - Gilles Pesant, Kuldeep S. Meel, Mahshid Mohammadalitajrishi:
On the Usefulness of Linear Modular Arithmetic in Constraint Programming. 248-265 - Mattia Silvestri, Michele Lombardi, Michela Milano:
Injecting Domain Knowledge in Neural Networks: A Controlled Experiment on a Constrained Problem. 266-282 - Adrian Bracher, Nikolaus Frohner, Günther R. Raidl:
Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. 283-298 - Jan Kronqvist
Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations. 299-314 - Ioannis Avgerinos
Logic-Based Benders Decomposition for an Inter-modal Transportation Problem. 315-331 - Victor Jung, Jean-Charles Régin
Checking Constraint Satisfaction. 332-347 - Özgür Akgün
Finding Subgraphs with Side Constraints. 348-364 - Max Åstrand, Mikael Johansson, Hamid Reza Feyzmahdavian:
Short-Term Scheduling of Production Fleets in Underground Mines Using CP-Based LNS. 365-382 - Till Porrmann, Michael Römer
Learning to Reduce State-Expanded Networks for Multi-activity Shift Scheduling. 383-391 - Félix Chalumeau, Ilan Coulon, Quentin Cappart, Louis-Martin Rousseau:
SeaPearl: A Constraint Programming Solver Guided by Reinforcement Learning. 392-409 - James Fitzpatrick
Learning to Sparsify Travelling Salesman Problem Instances. 410-426 - Serdar Kadioglu, Bernard Kleynhans, Xin Wang:
Optimized Item Selection to Boost Exploration for Recommender Systems. 427-445 - Augustin Parjadis, Quentin Cappart, Louis-Martin Rousseau, David Bergman:
Improving Branch-and-Bound Using Decision Diagrams and Reinforcement Learning. 446-455 - Tobias Geibinger
Physician Scheduling During a Pandemic. 456-465
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.
last updated on 2025-07-17 01:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: