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

A
Aghaei, Sina	[short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
Akgün, Özgür	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Ales, Zacharie	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Alghassi, Hedayat	Integer programming techniques for minor-embedding in quantum annealers
Allahverdi, Ali	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
Allahverdi, Muberra	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
Aloise, Daniel	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
Anis, Hassan	[short talk] Data-Driven Construction of Financial Factor Models
Aydilek, Asiye	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
Aydilek, Harun	[short talk] Algorithms and Effective Dominance Relations for a No-Wait Flowshop Scheduling with Random Setup Times
B
Basciftci, Beste	Bilevel Optimization for On-Demand Multimodal Transit Systems
Battistutta, Michele	Local search and constraint programming for a real-world examination timetabling problem
Beck, J. Christopher	An Ising Framework for Constrained Clustering on Special Purpose Hardware CP and Hybrid Models for Two-Stage Batching and Scheduling
Beldiceanu, Nicolas	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Benedikt, Ondřej	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Bengio, Yoshua	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Berg, Jeremias	Core-Guided and Core-Boosted Search for CP
Bernal, David	Integer programming techniques for minor-embedding in quantum annealers
Berthold, Timo	Conflict-Free Learning for Mixed Integer Programming
Biere, Armin	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Biere, Armin	Tutorial on Modern SAT Solving Maximum Satisfiability Recent Trends in Metaheuristics Recent Advances in Solving Numerically Challenging MIPs Numerical Constraint Programming In depth presentation of CP-SAT from the OR-Tools suite
Bissuel, Côme	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Blum, Christian	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
Booth, Kyle	Integer programming techniques for minor-embedding in quantum annealers
Bouchet, Pierre-Yves	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Bouhassoun, Abdel-Malik	[short talk] Solving the Sequential Ordering Problem with anytime tree search
Bourreau, Eric	Exact method approaches for the differential harvest problem
Braune, Roland	[short talk] Machine Learning-based Queuing Model Regression - Example Selection, Feature Engineering and the Role of Traffic Intensity
Brown, Kenneth N.	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Burdakov, Oleg	Minimum Cycle Partition with Length Requirements
Butscher, Adrian	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
C
Cambazard, Hadrien	[short talk] Solving the Sequential Ordering Problem with anytime tree search
Canoy, Rocsildes	Hybrid Classification and Reasoning for Image-based Constraint Solving
Carlsson, Mats	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Carvalho, Margarida	Algorithmic approaches for integer programming games and a story on policy making
Casselgren, Carl Johan	Minimum Cycle Partition with Length Requirements
Ceschia, Sara	Local search and constraint programming for a real-world examination timetabling problem
Cheong, Hyunmin	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Coffrin, Carleton	The Potential of Quantum Annealing for Rapid Solution Structure Identification
Cohen, Eldan	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Contaldo, Francesco	From MiniZinc to Optimization Modulo Theories, and Back
D
Dalmeijer, Kevin	Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
Dang, Nguyen	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
De Cesco, Fabio	Local search and constraint programming for a real-world examination timetabling problem
de Givry, Simon	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Demirović, Emir	Core-Guided and Core-Boosted Search for CP
Devriendt, Jo	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Di Gaspero, Luca	Local search and constraint programming for a real-world examination timetabling problem
Didier, Frédéric	In depth presentation of CP-SAT from the OR-Tools suite
Djukanovic, Marko	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
Dridi, Raouf	Integer programming techniques for minor-embedding in quantum annealers
E
Ebrahimi , Mehran	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Elffers, Jan	[short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
Etheve, Marc	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
F
Fabris, Irene	Optimizing Student Course Preferences in School Timetabling
Falkner, Jonas	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
Fazekas, Katalin	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Frejinger, Emma	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Frohner, Nikolaus	[short talk] A Beam Search Approach to the Traveling Tournament Problem
G
Gange, Graeme	Core-Guided and Core-Boosted Search for CP
Gerhards, Patrick	[short talk] Using CP and MIP techniques to tackle the Multi-mode Resource Investment Problem
Giroudeau, Rodolphe	Exact method approaches for the differential harvest problem
Gleixner, Ambros	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Gocht, Stephan	[short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
Gok, Yagmur	Robust Resource Planning for Aircraft Ground Operations
Gomez, Andres	[short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
Gottlob, Georg	Hypertree Decompositions: Questions and Answers
Gualandi, Stefano	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Guimarans, Daniel	Robust Resource Planning for Aircraft Ground Operations
Guns, Tias	Hybrid Classification and Reasoning for Image-based Constraint Solving
H
Hanzálek, Zdeněk	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Haouas, Mohammed Najib	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
Hebrard, Emmanuel	Introduction
Hoeve, Willem-Jan Van	Template Matching and Decision Diagrams for Multi-Agent Path Finding
Hogstad, Benjamin	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
Hoppmann, Kai	Minimum Cycle Partition with Length Requirements
Horn, Matthias	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
Hoshino, Richard	Optimizing Student Course Preferences in School Timetabling
I
Isoart, Nicolas	Adaptive CP-based Lagrangian Relaxation for TSP Solving
J
Jatschka, Thomas	[short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
Jonathan, Gaudreault	Leveraging Constraint Scheduling: A Case Study to the Textile Industry
Jost, Vincent	[short talk] Solving the Sequential Ordering Problem with anytime tree search
Juan, Olivier	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
K
Kameugne, Roger	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Katsirelos, George	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Kedad-Sidhoum, Safia	Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Koch, Thorsten	Minimum Cycle Partition with Length Requirements
Kumar, Abhinav	Lossless Compression of Deep Neural Networks
Kunczik, Leonhard	[short talk] A Reinforcement Learning Approach to the Labeled Maximum Matching Problem
Kwon, Roy	[short talk] Data-Driven Construction of Financial Factor Models
L
Lemos, Alexandre	Minimal Perturbation in University Timetabling with Maximum Satisfiability
Libralesso, Luc	[short talk] Solving the Sequential Ordering Problem with anytime tree search
Lodi, Andrea	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Lokhov, Andrey	The Potential of Quantum Annealing for Rapid Solution Structure Identification
Lynce, Inês	Minimal Perturbation in University Timetabling with Maximum Satisfiability
M
Mandi, Jayanta	Hybrid Classification and Reasoning for Image-based Constraint Solving
McCreesh, Ciaran	[short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
Mercier-Aubin, Alexandre	Leveraging Constraint Scheduling: A Case Study to the Textile Industry
Mexi, Gioni	Minimum Cycle Partition with Length Requirements
Miguel, Ian	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Mogali, Jayanth Krishna	Template Matching and Decision Diagrams for Multi-Agent Path Finding
Moll, Maximilian	[short talk] A Reinforcement Learning Approach to the Labeled Maximum Matching Problem
Monteiro, Pedro T.	Minimal Perturbation in University Timetabling with Maximum Satisfiability
Mulamba, Maxime	Hybrid Classification and Reasoning for Image-based Constraint Solving
Musliu, Nysret	Introduction CPAIOR 2021 and Conference Closing
Módos, István	[student paper award] Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
N
Naud, Olivier	Exact method approaches for the differential harvest problem
Neumann, Bernhard	[short talk] A Beam Search Approach to the Traveling Tournament Problem
Nordström, Jakob	Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search [short talk] Justifying All Differences Using Pseudo-Boolean Reasoning
O
Ozturk, Cemalettin	Robust Resource Planning for Aircraft Ground Operations
P
Pang, Yuchen	The Potential of Quantum Annealing for Rapid Solution Structure Identification
Parragh, Sophie	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Patel, Rahul	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Pesant, Gilles	An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
Piacentini, Chiara	Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Pokutta, Sebastian	Restarting Algorithms: Sometimes there is Free Lunch
Q
Quesada, Luis	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Quimper, Claude-Guy	Leveraging Constraint Scheduling: A Case Study to the Textile Industry
R
Raidl, Günther R.	[short talk] On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence [short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources [short talk] A Beam Search Approach to the Traveling Tournament Problem
Ramalingam, Srikumar	Lossless Compression of Deep Neural Networks
Restrepo-Ruiz, Maria-Isabel	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Rodemann, Tobias	[short talk] A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
Rousseau, Louis-Martin	[distinguished paper award] Primal Heuristics for Wasserstein Barycenters
Régin, Jean-Charles	Adaptive CP-based Lagrangian Relaxation for TSP Solving
S
Salamon, Andras Z.	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Sankaranarayanan, Sriram	A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Schaerf, Andrea	Local search and constraint programming for a real-world examination timetabling problem
Schaerf, Andrea	Recent Trends in Metaheuristics
Schaus, Pierre	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Schmidt-Thieme, Lars	[short talk] A Search Heuristic Guided Reinforcement Learning Approach to the Traveling Salesman Problem
Schulte, Christian	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Sebastiani, Roberto	From MiniZinc to Optimization Modulo Theories, and Back
Senderovich, Arik	An Ising Framework for Constrained Clustering on Special Purpose Hardware
Serra, Thiago	Lossless Compression of Deep Neural Networks Enumerative Branching with Less Repetition
Simonis, Helmut	Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Sinnl, Markus	Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem
Smith, Stephen	Template Matching and Decision Diagrams for Multi-Agent Path Finding
Spracklen, Patrick	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Stone, Christopher	Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Stuckey, Peter	Combinatorial Optimisation for Multi-Agent Path Finding Core-Guided and Core-Boosted Search for CP Robust Resource Planning for Aircraft Ground Operations
T
Tang, Tanya	CP and Hybrid Models for Two-Stage Batching and Scheduling
Tayur, Sridhar	Integer programming techniques for minor-embedding in quantum annealers
Thiessen, Maximilian	Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Thomas, Charles	Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Tomasella, Maurizio	Robust Resource Planning for Aircraft Ground Operations
Topan, Elena	Local search and constraint programming for a real-world examination timetabling problem
Trentin, Patrick	From MiniZinc to Optimization Modulo Theories, and Back
Trösser, Fulya	Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
V
Van Hentenryck, Pascal	Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems Bilevel Optimization for On-Demand Multimodal Transit Systems
Vayanos, Phebe	[short talk] Learning Optimal Classification Trees: Strong Max-Flow Formulations
Venturelli, Davide	Integer programming techniques for minor-embedding in quantum annealers
Volte, Gabriel	Exact method approaches for the differential harvest problem
Vuffray, Marc	The Potential of Quantum Annealing for Rapid Solution Structure Identification
W
Wallace, Mark	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
Wessén, Johan Ludde	Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Witzig, Jakob	Conflict-Free Learning for Mixed Integer Programming
Y
Yorke-Smith, Neil	A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem

Disclaimer | Powered by EasyChair Smart Program