Days: Monday, July 5th Tuesday, July 6th Wednesday, July 7th Thursday, July 8th
View this program: with abstractssession overviewtalk overview
Registration for the physical part of the conference. Lunch is served during this time at the conference location.
12:15 | Conference Opening PRESENTER: Peter Stuckey |
12:30 | Safety in AI Systems: SMT-Based Verification of Deep Neural Networks (abstract) |
13:30 | Formal Reasoning Methods in Machine Learning Explainability (abstract) |
15:00 | Towards verifying AI systems based on deep neural networks (abstract) |
16:00 | Reasoning About the Probabilistic Behavior of Classifiers (abstract) |
17:30 | Certified Artificial Intelligence (abstract) |
18:30 | Explaining Machine Learning Predictions: State-of-the-art, Challenges, and Opportunities (abstract) |
Dinner will be served at the Rathauskeller. We will walk there together after the master class.
View this program: with abstractssession overviewtalk overview
Guided tour on the topic "Gustav Klimt and His Time". We will meet a few minutes before 10:00 in front of the Upper Belvedere.
We will go to lunch together at Stöckl im Park after the guided tour.
13:00 | Improving the filtering of Branch-And-Bound MDD solver (abstract) |
13:20 | Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations (abstract) |
13:40 | MDDs boost equation solving on discrete dynamical systems (abstract) |
14:00 | Towards a Compact SAT-based Encoding of Itemset Mining Tasks (abstract) |
14:40 | Learning Variable Activity Initialisation for Lazy Clause Generation Solvers (abstract) |
15:00 | SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning (abstract) |
15:20 | MipConfigBench: A dataset for learning in the space of Mixed-Integer Programming algorithms (abstract) |
15:40 | Learning to Sparsify Travelling Salesman Problem Instances (abstract) |
16:30 | Contextual Optimization: Bridging Machine Learning and Operations |
17:45 | A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble (abstract) |
18:05 | Injecting Domain Knowledge in Neural Networks: a Controlled Experiment on a Constrained Problem (abstract) |
18:25 | IRELAND: an MILP-based algorithm for learning interpretable input-output relationships from large binary classification data (abstract) |
18:45 | Optimized Item Selection to Boost Exploration for Recommender Systems (abstract) |
View this program: with abstractssession overviewtalk overview
We will eat lunch at the Glacisbeisl. We will meet directly at the restaurant at 12:00, please be on time since the lunch time is a bit tight.
13:00 | Complete Symmetry Breaking Constraints For The Class of Uniquely Hamiltonian Graphs (abstract) |
13:20 | On the Usefulness of Linear Modular Arithmetic in Constraint Programming (abstract) |
13:40 | Finding Subgraphs with Side Constraints (abstract) |
14:00 | Checking Constraint Satisfaction (abstract) |
14:40 | Logic-Based Benders Decomposition for an Inter-modal Transportation Problem (abstract) PRESENTER: Ioannis Avgerinos |
15:00 | Strengthening of feasibility cuts in logic-based Benders decomposition (abstract) |
15:20 | Combining Constraint Programming and Time Based Decomposition Approaches – Scheduling of an Industrial Formulation Plant (abstract) |
15:40 | Storage Location Assignment Problem in Fast Pick Areas: A novel formulation and decomposition method (abstract) |
16:30 | Why You Should Constrain Your Machine Learned Models |
17:45 | Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors (abstract) |
18:05 | A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects (abstract) |
18:25 | Single-Machine Scheduling with Release Times, Deadlines, Setup Times, and Rejection (abstract) |
18:45 | Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints (abstract) |
Banquet at the Heurigen Buschenschank Fuhrgassl-Huber. We will go there together after the last session by bus. We will go back to the conference location afterwards by bus, but you can also go back on your own using public transport.
View this program: with abstractssession overviewtalk overview
We will eat lunch at the Glacisbeisl. We will meet directly at the restaurant at 12:00, please be on time since the lunch time is a bit tight.
13:00 | Variable Ordering for Decision Diagrams: A Portfolio Approach (abstract) |
13:20 | A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem (abstract) |
13:40 | Improving Branch-and-Bound using Decision Diagrams and Reinforcement Learning (abstract) |
14:00 | Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding (abstract) |
14:40 | Partitioning Students into Cohorts during COVID-19 (abstract) |
15:00 | Physician Scheduling During a Pandemic (abstract) |
15:20 | Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling (abstract) |
15:40 | The Traveling Social Golfer Problem: the case of the Volleyball Nations League (abstract) |
16:30 | Supercharging Plant Configurations using Z3 PRESENTER: Nikolaj Bjorner |
17:45 | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems (abstract) |
18:05 | Short-term scheduling of production fleets in underground mines using CP-based LNS (abstract) |
18:25 | A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming (abstract) |
18:45 | A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming (abstract) |