CPAIOR B

30 papers

YearTitle / Authors
2021A
Matthias Horn, Günther R. Raidl
2021A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects.
Alessandro Hill, Jordan Ticktin, Thomas W. M. Vossen
2021A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming.
Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui
2021A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble.
Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha
2021Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations.
Jan Kronqvist, Ruth Misener, Calvin Tsay
2021Checking Constraint Satisfaction.
Victor Jung, Jean-Charles Régin
2021Combining Constraint Programming and Temporal Decomposition Approaches - Scheduling of an Industrial Formulation Plant.
Christian Klanke, Dominik R. Bleidorn, Vassilios Yfantis, Sebastian Engell
2021Finding Subgraphs with Side Constraints.
Özgür Akgün, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler
2021Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding.
Eldan Cohen, J. Christopher Beck
2021Improving Branch-and-Bound Using Decision Diagrams and Reinforcement Learning.
Augustin Parjadis, Quentin Cappart, Louis-Martin Rousseau, David Bergman
2021Improving the Filtering of Branch-and-Bound MDD Solver.
Xavier Gillard, Vianney Coppé, Pierre Schaus, André Augusto Ciré
2021Injecting Domain Knowledge in Neural Networks: A Controlled Experiment on a Constrained Problem.
Mattia Silvestri, Michele Lombardi, Michela Milano
2021Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5-8, 2021, Proceedings
Peter J. Stuckey
2021Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems.
Adrian Bracher, Nikolaus Frohner, Günther R. Raidl
2021Learning Variable Activity Initialisation for Lazy Clause Generation Solvers.
Ronald van Driel, Emir Demirovic, Neil Yorke-Smith
2021Learning to Reduce State-Expanded Networks for Multi-activity Shift Scheduling.
Till Porrmann, Michael Römer
2021Learning to Sparsify Travelling Salesman Problem Instances.
James Fitzpatrick, Deepak Ajwani, Paula Carroll
2021Logic-Based Benders Decomposition for an Inter-modal Transportation Problem.
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
2021MDDs Boost Equation Solving on Discrete Dynamical Systems.
Enrico Formenti, Jean-Charles Régin, Sara Riva
2021On the Usefulness of Linear Modular Arithmetic in Constraint Programming.
Gilles Pesant, Kuldeep S. Meel, Mahshid Mohammadalitajrishi
2021Optimized Item Selection to Boost Exploration for Recommender Systems.
Serdar Kadioglu, Bernard Kleynhans, Xin Wang
2021Partitioning Students into Cohorts During COVID-19.
Richard Hoshino, Irene Fabris
2021Physician Scheduling During a Pandemic.
Tobias Geibinger, Lucas Kletzander, Matthias Krainz, Florian Mischek, Nysret Musliu, Felix Winter
2021SeaPearl: A Constraint Programming Solver Guided by Reinforcement Learning.
Félix Chalumeau, Ilan Coulon, Quentin Cappart, Louis-Martin Rousseau
2021Short-Term Scheduling of Production Fleets in Underground Mines Using CP-Based LNS.
Max Åstrand, Mikael Johansson, Hamid Reza Feyzmahdavian
2021Strengthening of Feasibility Cuts in Logic-Based Benders Decomposition.
Emil Karlsson, Elina Rönnberg
2021Supercharging Plant Configurations Using Z3.
Nikolaj S. Bjørner, Maxwell Levatich, Nuno P. Lopes, Andrey Rybalchenko, Chandrasekar Vuppalapati
2021The Traveling Social Golfer Problem: The Case of the Volleyball Nations League.
Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma
2021Towards a Compact SAT-Based Encoding of Itemset Mining Tasks.
Ikram Nekkache, Saïd Jabbour, Lakhdar Sais, Nadjet Kamel
2021Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors.
Claire Hanen, Alix Munier Kordon, Theo Pedersen