CPAIOR2021: 18TH INTERNATIONAL CONFERENCE ON THE INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE AND OPERATIONS RESEARCH

This page contains an index consisting of author-provided keywords.

A
A* Search	A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem
abstract interpretation	Certified Artificial Intelligence
AI systems	Certified Artificial Intelligence
algorithm configuration	MipConfigBench: A dataset for learning in the space of Mixed-Integer Programming algorithms
algorithm portfolio	Variable Ordering for Decision Diagrams: A Portfolio Approach
Algorithms	IRELAND: an MILP-based algorithm for learning interpretable input-output relationships from large binary classification data
Automation	A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming
Autonomous learning	A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects
B
Batch Process Scheduling	Combining Constraint Programming and Time Based Decomposition Approaches – Scheduling of an Industrial Formulation Plant
Beam Search	Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding
benchmarking CP-SAT MIP and OMT solvers	Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
Benders decomposition	Logic-Based Benders Decomposition for an Inter-modal Transportation Problem
Binary decision diagrams	Improving Branch-and-Bound using Decision Diagrams and Reinforcement Learning
Branch-and-bound	Improving Branch-and-Bound using Decision Diagrams and Reinforcement Learning
branch-and-bound mdd	Improving the filtering of Branch-And-Bound MDD solver
C
certification	Towards verifying AI systems based on deep neural networks
checksum	On the Usefulness of Linear Modular Arithmetic in Constraint Programming
Chuffed	Learning Variable Activity Initialisation for Lazy Clause Generation Solvers
classification	Reasoning About the Probabilistic Behavior of Classifiers
closing	Conference Closing
Column generation	Storage Location Assignment Problem in Fast Pick Areas: A novel formulation and decomposition method
combinatorial optimisation	Finding Subgraphs with Side Constraints
conference	Conference Opening Conference Closing
constraint acquisition	Checking Constraint Satisfaction
Constraint learning	Checking Constraint Satisfaction
constraint optimization	Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
Constraint Programming	Physician Scheduling During a Pandemic SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning Combining Constraint Programming and Time Based Decomposition Approaches – Scheduling of an Industrial Formulation Plant A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects Short-term scheduling of production fleets in underground mines using CP-based LNS Logic-Based Benders Decomposition for an Inter-modal Transportation Problem On the Usefulness of Linear Modular Arithmetic in Constraint Programming
Constraint Satisfaction Problems	Injecting Domain Knowledge in Neural Networks: a Controlled Experiment on a Constrained Problem
Convex MINLP	Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations
convex optimization	Certified Artificial Intelligence
COVID-19	Physician Scheduling During a Pandemic
CPAIOR	Conference Opening Conference Closing
Cut strengthening	Strengthening of feasibility cuts in logic-based Benders decomposition
D
Data Mining	Towards a Compact SAT-based Encoding of Itemset Mining Tasks
data-driven optimization	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
deadlines	Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors
decision diagrams	Single-Machine Scheduling with Release Times, Deadlines, Setup Times, and Rejection Variable Ordering for Decision Diagrams: A Portfolio Approach
decision-diagrams based optimization	Improving the filtering of Branch-And-Bound MDD solver
Decomposition Algorithm	Combining Constraint Programming and Time Based Decomposition Approaches – Scheduling of an Industrial Formulation Plant
Decomposition methods	The Traveling Social Golfer Problem: the case of the Volleyball Nations League
Deep Learning	Injecting Domain Knowledge in Neural Networks: a Controlled Experiment on a Constrained Problem
Discrete Dynamical Systems	MDDs boost equation solving on discrete dynamical systems
Disjunctive programming	Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations
Dual bound	Storage Location Assignment Problem in Fast Pick Areas: A novel formulation and decomposition method
Dynamic and stochastic vehicle routing	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
dynamic programming	Single-Machine Scheduling with Release Times, Deadlines, Setup Times, and Rejection
E
embedded predictive models	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
energetic reasoning	Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors
ensemble learning	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
experiments	Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors
explainability	Formal Reasoning Methods in Machine Learning Explainability Explaining Machine Learning Predictions: State-of-the-art, Challenges, and Opportunities
explanation methods	Explaining Machine Learning Predictions: State-of-the-art, Challenges, and Opportunities
Exploration-Exploitation	Optimized Item Selection to Boost Exploration for Recommender Systems
F
Fast pick area	Storage Location Assignment Problem in Fast Pick Areas: A novel formulation and decomposition method
Feasibility cuts	Strengthening of feasibility cuts in logic-based Benders decomposition
Formulations	Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations
G
Gauss-Jordan elimination	On the Usefulness of Linear Modular Arithmetic in Constraint Programming
graph coloring	Variable Ordering for Decision Diagrams: A Portfolio Approach
Graph Sparsification	Learning to Sparsify Travelling Salesman Problem Instances
Graphical Optimization Models	Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling
Graphs semiring	MDDs boost equation solving on discrete dynamical systems
H
Hybrid Algorithm	A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming
hybrid solving	Finding Subgraphs with Side Constraints
I
Inclusion	Checking Constraint Satisfaction
infeasible space search	A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming
Integer Programming	Learning to Sparsify Travelling Salesman Problem Instances Logic-Based Benders Decomposition for an Inter-modal Transportation Problem The Traveling Social Golfer Problem: the case of the Volleyball Nations League Partitioning Students into Cohorts during COVID-19
integrated routing problem	A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming
Inter-modal transportation problem	Logic-Based Benders Decomposition for an Inter-modal Transportation Problem
Interpretable AI	IRELAND: an MILP-based algorithm for learning interpretable input-output relationships from large binary classification data
Irreducible infeasible subset of constraints	Strengthening of feasibility cuts in logic-based Benders decomposition
Isomoprh-free graph generation	Complete Symmetry Breaking Constraints For The Class of Uniquely Hamiltonian Graphs
Item Selection	Optimized Item Selection to Boost Exploration for Recommender Systems
Itemset Mining	Towards a Compact SAT-based Encoding of Itemset Mining Tasks
L
large neighborhood search	Short-term scheduling of production fleets in underground mines using CP-based LNS
lazy-clause generation solving	Learning Variable Activity Initialisation for Lazy Clause Generation Solvers
Linear Programming	Learning to Sparsify Travelling Salesman Problem Instances
Logic-based Benders decomposition	Strengthening of feasibility cuts in logic-based Benders decomposition
Longest Common Subsequence Problem	A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem
M
machine learning	Learning to Sparsify Travelling Salesman Problem Instances Learning Variable Activity Initialisation for Lazy Clause Generation Solvers Formal Reasoning Methods in Machine Learning Explainability Explaining Machine Learning Predictions: State-of-the-art, Challenges, and Opportunities
Machine Learning for Combinatorial Optimization	Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling
matheuristic	A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming
MDD	Checking Constraint Satisfaction
MDD operators	Checking Constraint Satisfaction
MIP	MipConfigBench: A dataset for learning in the space of Mixed-Integer Programming algorithms
Mixed integer linear programming	IRELAND: an MILP-based algorithm for learning interpretable input-output relationships from large binary classification data
Mixed-Integer Linear Programming	Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling
Mixed-integer programming	Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations
model counting	On the Usefulness of Linear Modular Arithmetic in Constraint Programming
modular arithmetic	On the Usefulness of Linear Modular Arithmetic in Constraint Programming
Moving-horizon	Combining Constraint Programming and Time Based Decomposition Approaches – Scheduling of an Industrial Formulation Plant
multi-armed bandit	Variable Ordering for Decision Diagrams: A Portfolio Approach
Multi-Valued Decision Diagram	A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem
Multi-valued decision diagrams	MDDs boost equation solving on discrete dynamical systems
N
neural network	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
neural networks	Injecting Domain Knowledge in Neural Networks: a Controlled Experiment on a Constrained Problem Safety in AI Systems: SMT-Based Verification of Deep Neural Networks Towards verifying AI systems based on deep neural networks
Neural Sequence Models	Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding
O
opening	Conference Opening
Optimization	MipConfigBench: A dataset for learning in the space of Mixed-Integer Programming algorithms A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming Partitioning Students into Cohorts during COVID-19
P
Physician Scheduling	Physician Scheduling During a Pandemic
Pickup and delivery planning	Logic-Based Benders Decomposition for an Inter-modal Transportation Problem
Pipe Routing	A Pipe Routing Hybrid Approach based on A-Star Search and Linear Programming
preemption	Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors
probabilistic models	Reasoning About the Probabilistic Behavior of Classifiers
production routing	A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming
pruning	Improving the filtering of Branch-And-Bound MDD solver
R
Randomized Restarts	Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding
reasoning	Reasoning About the Probabilistic Behavior of Classifiers
Recommender Systems	Optimized Item Selection to Boost Exploration for Recommender Systems
Reinforcement learning	SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning Improving Branch-and-Bound using Decision Diagrams and Reinforcement Learning
Relaxation comparison	Between Steps: Intermediate Relaxations between big-M and Convex Hull Formulations
Resource-constrained project scheduling	A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects
S
Same-day delivery	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
Sampling	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
Satisfiability	Towards a Compact SAT-based Encoding of Itemset Mining Tasks
scheduling	Single-Machine Scheduling with Release Times, Deadlines, Setup Times, and Rejection Short-term scheduling of production fleets in underground mines using CP-based LNS Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors
School Timetabling	Partitioning Students into Cohorts during COVID-19
Set Covering	Optimized Item Selection to Boost Exploration for Recommender Systems
Shift Scheduling	Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling
SMT	Safety in AI Systems: SMT-Based Verification of Deep Neural Networks
Social golfer problem	The Traveling Social Golfer Problem: the case of the Volleyball Nations League
soft coupled task scheduling	Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
Solver Design	SeaPearl: A Constraint Programming Solver guided by Reinforcement Learning
State-Expanded Networks	Learning to Reduce State-Expanded Networks for Multi-Activity Shift Scheduling
Storage location assignment	Storage Location Assignment Problem in Fast Pick Areas: A novel formulation and decomposition method
subgraph isomorphism	Finding Subgraphs with Side Constraints
Supervised learning	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
Surrogate function optimization	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
surrogate model	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
Symmetry breaking	Complete Symmetry Breaking Constraints For The Class of Uniquely Hamiltonian Graphs
T
tour-dependent edge Costs	Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
transportation	A matheuristic for the Production Routing Problem: Infeasibility Space Search and Mixed Integer Programming
Travelling Salesman Problem	Learning to Sparsify Travelling Salesman Problem Instances
trust	Formal Reasoning Methods in Machine Learning Explainability
TSP with precedence Constraints	Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
two-stage optimization	A Two-Phases Exact Algorithm for Optimization of Neural Network Ensemble
U
underground mining	Short-term scheduling of production fleets in underground mines using CP-based LNS
Uniquely Hamiltonian graphs	Complete Symmetry Breaking Constraints For The Class of Uniquely Hamiltonian Graphs
unsatisfiable core	Learning Variable Activity Initialisation for Lazy Clause Generation Solvers
V
verification	Safety in AI Systems: SMT-Based Verification of Deep Neural Networks Towards verifying AI systems based on deep neural networks
Volleyball Nations League	The Traveling Social Golfer Problem: the case of the Volleyball Nations League
VSIDS	Learning Variable Activity Initialisation for Lazy Clause Generation Solvers

Disclaimer | Powered by EasyChair Smart Program