CPAIOR 2020: SEVENTEENTH INTERNATIONAL CONFERENCE ON THE INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH

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

A
Airport Operations	Robust Resource Planning for Aircraft Ground Operations
Algebraic geometry	Integer programming techniques for minor-embedding in quantum annealers
algorithms	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times Hypertree Decompositions: Questions and Answers
Antibandwidth problem	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Application	Leveraging Constraint Scheduling: A Case Study to the Textile Industry
Armin	Tutorial on Modern SAT Solving
artificial intelligence	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
assembly manufacturing	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Asset Pricing	[short talk] Data-Driven Construction of Financial Factor Models
At-most-one constraints	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Autoencoders	[short talk] Data-Driven Construction of Financial Factor Models
Aviation	Robust Resource Planning for Aircraft Ground Operations
B
Batch scheduling	CP and Hybrid Models for Two-Stage Batching and Scheduling
Beam Search	[short talk] A Beam Search Approach to the Traveling Tournament Problem [short talk] Solving the Sequential Ordering Problem with anytime tree search
Belief Propagation	The Potential of Quantum Annealing for Rapid Solution Structure Identification
Benders decomposition	Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
Benders Decompositon	Bilevel Optimization for On-Demand Multimodal Transit Systems
Benders' Decomposition	[short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
Berthold	Recent Advances in Solving Numerically Challenging MIPs
Best Subset Selection	[short talk] Data-Driven Construction of Financial Factor Models
Best-First Search	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Biere	Tutorial on Modern SAT Solving
Bilevel optimization	Bilevel Optimization for On-Demand Multimodal Transit Systems
Binary decision diagrams	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
bounds	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Branch and Bound	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Branch-and-Bound	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH Relaxation-Aware Heuristics for Exact Optimization in Graphical Models Enumerative Branching with Less Repetition
Branching Strategy	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
break
C
cardinality constraint	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
closing	CPAIOR 2021 and Conference Closing
clustering	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
coffee
collaborative robotics	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Column generation	Exact method approaches for the differential harvest problem
Combinatorial Cuts	Bilevel Optimization for On-Demand Multimodal Transit Systems
Combinatorial Optimization	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems Minimum Cycle Partition with Length Requirements [distinguished paper award] Primal Heuristics for Wasserstein Barycenters [short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations [short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem [short talk] A Reinforcement Learning Approach to the Labeled Maximum Matching Problem
Complexity Theory	Hypertree Decompositions: Questions and Answers
conflict analysis	Conflict-Free Learning for Mixed Integer Programming
Conflict Graph	Minimum Cycle Partition with Length Requirements
Conflict-driven search	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Constrained Clustering	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Constraint Programming	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP Insertion Sequence Variables for Hybrid Routing and Scheduling Problems Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH CP and Hybrid Models for Two-Stage Batching and Scheduling Core-Guided and Core-Boosted Search for CP Optimizing Student Course Preferences in School Timetabling [short talk] Justifying All Differences Using Pseudo-Boolean Reasoning [short talk] Using CP and MIP techniques to tackle the Multi-mode Resource Investment Problem Combinatorial Optimisation for Multi-Agent Path Finding Numerical Constraint Programming
Constraint Reasoning	Hybrid Classification and Reasoning for Image-based Constraint Solving
Constraints programming	Exact method approaches for the differential harvest problem
core-guided	Core-Guided and Core-Boosted Search for CP
Cost function network	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
CP	In depth presentation of CP-SAT from the OR-Tools suite
CPAIOR	Introduction CPAIOR 2021 and Conference Closing
Cut generation	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Cutting plane proofs	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
cutting planes	Template Matching and Decision Diagrams for Multi-Agent Path Finding [short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
D
Decision Diagrams	Template Matching and Decision Diagrams for Multi-Agent Path Finding Enumerative Branching with Less Repetition [short talk] A Beam Search Approach to the Traveling Tournament Problem [short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
Decomposition	Integer programming techniques for minor-embedding in quantum annealers
Deep Learning	Lossless Compression of Deep Neural Networks
Deep Reinforcement Learning	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
Degree-Constrained Minimum Spanning Tree	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Depth-First Search	Enumerative Branching with Less Repetition
Dial-A-Ride Problem	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
dinner
Discrete Optimization	The Potential of Quantum Annealing for Rapid Solution Structure Identification Combinatorial Optimisation for Multi-Agent Path Finding
dual arm collision avoidance	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
dual proof analysis	Conflict-Free Learning for Mixed Integer Programming
Dynamic Programming	[short talk] Solving the Sequential Ordering Problem with anytime tree search
E
Enumeration	Exact method approaches for the differential harvest problem
Evolutionary Algorithms	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Exact method	Exact method approaches for the differential harvest problem
Examination timetabling	Local search and constraint programming for a real-world examination timetabling problem
F
Facility Location Problem	[short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
FDCP	From MiniZinc to Optimization Modulo Theories, and Back
Feature engineering	[short talk] Machine Learning-based Queuing Model Regression - Example Selection, Feature Engineering and the Role of Traffic Intensity
Filtering Algorithms	Adaptive CP-based Lagrangian Relaxation for TSP Solving
Finite Domain Constraint Programming	From MiniZinc to Optimization Modulo Theories, and Back
FlatZinc	From MiniZinc to Optimization Modulo Theories, and Back
Flowshop scheduling	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
G
Games	Algorithmic approaches for integer programming games and a story on policy making
global constraint	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Global Search	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Google	In depth presentation of CP-SAT from the OR-Tools suite
Graph Coloring	Optimizing Student Course Preferences in School Timetabling
Graph Embedding	[short talk] A Reinforcement Learning Approach to the Labeled Maximum Matching Problem
Graph minors	Integer programming techniques for minor-embedding in quantum annealers
Graphical model	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
H
Heuristics	CP and Hybrid Models for Two-Stage Batching and Scheduling Recent Trends in Metaheuristics
hoist scheduling	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
I
Information Systems	Hypertree Decompositions: Questions and Answers
Instance generation	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Integer Programming	Integer programming techniques for minor-embedding in quantum annealers Optimizing Student Course Preferences in School Timetabling The Potential of Quantum Annealing for Rapid Solution Structure Identification Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search Enumerative Branching with Less Repetition Algorithmic approaches for integer programming games and a story on policy making Restarting Algorithms: Sometimes there is Free Lunch
introduction	Introduction
Ising	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Ising Model	The Potential of Quantum Annealing for Rapid Solution Structure Identification
J
Joint Inference	Hybrid Classification and Reasoning for Image-based Constraint Solving
K
Kantorovich-Wasserstein Distance	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Kidney exchange	Algorithmic approaches for integer programming games and a story on policy making
L
Lagrangian Relaxation	Adaptive CP-based Lagrangian Relaxation for TSP Solving
Lagrangian relaxations	Template Matching and Decision Diagrams for Multi-Agent Path Finding
Large Neighborhood Search	Leveraging Constraint Scheduling: A Case Study to the Textile Industry The Potential of Quantum Annealing for Rapid Solution Structure Identification [short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
lazy clause generation	Core-Guided and Core-Boosted Search for CP
Linear Programming	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search [distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Linear relaxation	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
LKH	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Local polytope	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Local Search	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH The Potential of Quantum Annealing for Rapid Solution Structure Identification Recent Trends in Metaheuristics
Logic Programming	Combinatorial Optimisation for Multi-Agent Path Finding
Logic-based Benders decomposition	CP and Hybrid Models for Two-Stage Batching and Scheduling
lunch
M
Machine Learning	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs [short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations [short talk] Machine Learning-based Queuing Model Regression - Example Selection, Feature Engineering and the Role of Traffic Intensity Restarting Algorithms: Sometimes there is Free Lunch
Machine states	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
master class	Introduction
Maximum Independent Set	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
maximum lateness	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
MaxSAT	Minimal Perturbation in University Timetabling with Maximum Satisfiability Core-Guided and Core-Boosted Search for CP Maximum Satisfiability
meta-heuristics	Recent Trends in Metaheuristics
midnight-snack
Minimal Perturbation	Minimal Perturbation in University Timetabling with Maximum Satisfiability
minimum cost flow	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
MiniZinc	From MiniZinc to Optimization Modulo Theories, and Back Local search and constraint programming for a real-world examination timetabling problem A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
MIP	Recent Advances in Solving Numerically Challenging MIPs In depth presentation of CP-SAT from the OR-Tools suite
Mixed Integer Linear Programming	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Mixed Integer Programming	Minimum Cycle Partition with Length Requirements Conflict-Free Learning for Mixed Integer Programming [short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
Mixed-Integer Linear Programming	Lossless Compression of Deep Neural Networks
Mixed-integer programming	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP [short talk] Using CP and MIP techniques to tackle the Multi-mode Resource Investment Problem
Mode Choice	Bilevel Optimization for On-Demand Multimodal Transit Systems
modelling	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
Multi-agent pathfinding	Template Matching and Decision Diagrams for Multi-Agent Path Finding
Multi-objective	Maximum Satisfiability
Multimodal transportation	Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
multiple cores	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
N
Neural Network	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Neural Network Compression	Lossless Compression of Deep Neural Networks
Neural Networks	[short talk] Data-Driven Construction of Financial Factor Models
Neuron Stability	Lossless Compression of Deep Neural Networks
no-good learning	Conflict-Free Learning for Mixed Integer Programming
no-wait	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
Non-convex Optimization	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
nonlinear	Numerical Constraint Programming
Nonlinear Factor Models	[short talk] Data-Driven Construction of Financial Factor Models
Numerical	Numerical Constraint Programming
O
OMT	From MiniZinc to Optimization Modulo Theories, and Back
On-Demand Transit System	Bilevel Optimization for On-Demand Multimodal Transit Systems
Optimal Decision Trees	[short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
optimisation	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
Optimization	Robust Resource Planning for Aircraft Ground Operations Optimizing Student Course Preferences in School Timetabling [short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources Restarting Algorithms: Sometimes there is Free Lunch
Optimization Modulo Theory	From MiniZinc to Optimization Modulo Theories, and Back
Outlook	CPAIOR 2021 and Conference Closing
P
Parallel	Maximum Satisfiability
Patient Transportation Problem	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Post Enrollment Course Timetabling Problem	Optimizing Student Course Preferences in School Timetabling
Precision agriculture	Exact method approaches for the differential harvest problem
Prediction and Optimisation	Hybrid Classification and Reasoning for Image-based Constraint Solving
Primal Heuristic	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Project Scheduling	[short talk] Using CP and MIP techniques to tackle the Multi-mode Resource Investment Problem
proof logging	[short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
pseudo-Boolean	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search [short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
Q
Quadratic Unconstrained Binary Optimization	The Potential of Quantum Annealing for Rapid Solution Structure Identification
Quantum Annealers	Integer programming techniques for minor-embedding in quantum annealers
Quantum Annealing	The Potential of Quantum Annealing for Rapid Solution Structure Identification
QUBO	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Queuing systems	[short talk] Machine Learning-based Queuing Model Regression - Example Selection, Feature Engineering and the Role of Traffic Intensity
R
random setup times	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
Rectifier Linear Unit	Lossless Compression of Deep Neural Networks
Regression	[short talk] Machine Learning-based Queuing Model Regression - Example Selection, Feature Engineering and the Role of Traffic Intensity
regular expression	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Reinforcement Learning	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm [short talk] A Reinforcement Learning Approach to the Labeled Maximum Matching Problem
remarks
Repetition-Free Longest Common Subsequence	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
robot planning and scheduling	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
robot program generation	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
robot task allocation	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
robot task sequencing	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
robot workspace layout optimization	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
RoundingSat	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Routing	Robust Resource Planning for Aircraft Ground Operations
S
SAT	Tutorial on Modern SAT Solving
SAT encoding	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Sat4J	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Scenario Reduction	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Scheduling	Leveraging Constraint Scheduling: A Case Study to the Textile Industry Insertion Sequence Variables for Hybrid Routing and Scheduling Problems Robust Resource Planning for Aircraft Ground Operations
School Timetabling	Optimizing Student Course Preferences in School Timetabling
SCIP	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Sequence Variable	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Sequential Ordering Problem	[short talk] Solving the Sequential Ordering Problem with anytime tree search
Simulated Annealing	Local search and constraint programming for a real-world examination timetabling problem
Single machine production scheduling	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Solution Enumeration	Enumerative Branching with Less Repetition
solution learning	Conflict-Free Learning for Mixed Integer Programming
Special Purpose Hardware	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Stochastic Integer Program	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Stochastic Search	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Supervised Learning	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
T
Timo	Recent Advances in Solving Numerically Challenging MIPs
Total energy cost minimization	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Transfer-expanded graphs	Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
Traveling Salesman Person	Leveraging Constraint Scheduling: A Case Study to the Textile Industry
Traveling Salesman Problem	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
Traveling Tournament Problem	[short talk] A Beam Search Approach to the Traveling Tournament Problem
Tree Search	[short talk] Solving the Sequential Ordering Problem with anytime tree search
TSP	Adaptive CP-based Lagrangian Relaxation for TSP Solving
U
University Timetabling	Minimal Perturbation in University Timetabling with Maximum Satisfiability
V
Variable energy costs	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Variable ordering heuristic	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Vehicle Routing	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Virtual arc consistency	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Visual sudoku	Hybrid Classification and Reasoning for Image-based Constraint Solving
W
Wasserstein Barycenter	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters

Disclaimer | Powered by EasyChair Smart Program