CPAIOR2024: INTERNATIONAL CONFERENCE ON THE INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH

A
Adulyasak, Yossiri	A data-driven method for constraint customization in optimization models
Aglin, Gaël	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems
Alessandro, Cimatti	SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability
Allouche, David	Bi-Objective Discrete Graphical Model Optimization
Amiri, Elahe	Online optimization of a dial-a-ride problem with the integral primal simplex
Andrea, Micheli	SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability
Anjos, Miguel	Learning Deterministic Surrogates for Robust Convex QCQP
Azema, Mathis	A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints
B
Barral, Hugo	Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
Bayani, Mahdis	A data-driven method for constraint customization in optimization models
Bekkoucha, Djawad	Efficiently Mining Closed Interval Patterns with Constraint Programming
Benazera, Emmanuel	Learning to Solve Job Shop Scheduling under Uncertainty
Berden, Senne	Task Generalization in Decision-Focused Learning
Berg, Jeremias	Core Boosting in SAT-Based Multi-Objective Optimization MaxSAT-Based Bi-Objective Boolean Optimization
Berjaoui, Ahmad	Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Bernal Neira, David	Accelerating Continuous Variable Coherent Ising Machines via Momentum
Berthiaume, Frédéric	Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue
Besançon, Mathieu	Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model [BEST STUDENT PAPER]
Bierlee, Hendrik	Single Constant Multiplication for SAT
Boisvert, Léo	Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches
Boizumault, Patrice	Efficiently Mining Closed Interval Patterns with Constraint Programming
Bongrand, Pierre	On Learning CP-SAT Resolution Outcomes Before Reaching Time-Limit
Borndoerfer, Ralf	ULD Build-Up Scheduling with Logic-Based Benders Decomposition
Brown, Robin	Accelerating Continuous Variable Coherent Ising Machines via Momentum
Bucarey, Víctor	Decision-focused predictions via pessimistic bilevel optimization: a computational study
Buchet, Samuel	Bi-Objective Discrete Graphical Model Optimization
Burlats, Auguste	An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis
C
Cai, Junyang	Optimization Over Trained Neural Networks: Taking a Relaxing Walk
Calderón, Sophia	Decision-focused predictions via pessimistic bilevel optimization: a computational study
Cameron, Chris	UNSAT Solver Synthesis via Monte Carlo Forest Search
Cappart, Quentin	Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
Cassenote, Mariane R. S.	A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization
Chen, Rex	UNSAT Solver Synthesis via Monte Carlo Forest Search
Chen, Violet	Assessing Group Fairness with Social Welfare Optimization [BEST PAPER]
Contardo, Claudio	Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming
Coppé, Vianney	Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams
Cremilleux, Bruno	Efficiently Mining Closed Interval Patterns with Constraint Programming
Côté, Alain	Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
D
Davies, Toby	ViolationLS: Constraint-Based Local Search in CP-SAT
de Givry, Simon	Bi-Objective Discrete Graphical Model Optimization
de Rezende, Pedro J.	Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches
de Weerdt, Mathijs	Learning From Scenarios for Repairable Stochastic Scheduling
Dekker, Jip J.	Single Constant Multiplication for SAT
Dems, Amira	Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
Derenievicz, Guilherme A.	A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization
Desaulniers, Guy	A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints
Didier, Frédéric	ViolationLS: Constraint-Based Local Search in CP-SAT
Dilkina, Bistra	Trade-offs in Multi-objective Problems: Finding Top-k Non-dominated Solutions
Dimitriou, Tassos	The strange case of XOR-CNF formulas: SAT Obfuscation and more
E
El Hallaoui, Issmaïl	Online optimization of a dial-a-ride problem with the integral primal simplex
Euler, Ricardo	ULD Build-Up Scheduling with Logic-Based Benders Decomposition
F
Fischer, Vera	A Benders decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities
Flecker, Alexander	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Forel, Alexandre	Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles
Foschini, Marco	Trade-offs in Multi-objective Problems: Finding Top-k Non-dominated Solutions
Freeman, Alexander	On Learning CP-SAT Resolution Outcomes Before Reaching Time-Limit
Freydell, Esteban	Learning From Scenarios for Repairable Stochastic Scheduling
Fukasawa, Ricardo	Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming
G
Gaha, Mohamed	Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
Gardos Reid, Reuben	On Learning CP-SAT Resolution Outcomes Before Reaching Time-Limit
Gawas, Prakash	An Imitation Learning approach for Personnel Scheduling with flexibility for On-Call Shifts
Gillard, Xavier	Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams
Gleixner, Ambros	Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs A Delta Debugger for Mixed-Integer Programming Solvers
Gocht, Stephan	End-to-End Verification for Subgraph Solving
Gomes, Carla P.	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Grimson, Marc	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Gunluk, Oktay	Fair Minimum Representation Clustering
Guns, Tias	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems Task Generalization in Decision-Focused Learning Trade-offs in Multi-objective Problems: Finding Top-k Non-dominated Solutions Keynote: Decision-Focused Learning: Foundations, State of the Art, Benchmarks and Future Opportunities
H
Hallsworth, Sian	On Learning CP-SAT Resolution Outcomes Before Reaching Time-Limit
Hartford, Jason	UNSAT Solver Synthesis via Monte Carlo Forest Search
Heilpern, Sebastian	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Hijazi, Hassan	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Hoen, Alexander	Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs A Delta Debugger for Mixed-Integer Programming Solvers
Hooker, John	Assessing Group Fairness with Social Welfare Optimization [BEST PAPER]
I
Infantes, Guillaume	Learning to Solve Job Shop Scheduling under Uncertainty
J
Jabs, Christoph	Core Boosting in SAT-Based Multi-Objective Optimization MaxSAT-Based Bi-Objective Boolean Optimization
Jacquet, Antoine	Learning to Solve Job Shop Scheduling under Uncertainty
Jones, Haydn	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Järvisalo, Matti	Core Boosting in SAT-Based Multi-Objective Optimization MaxSAT-Based Bi-Objective Boolean Optimization
K
Kamp, Dominik	A Delta Debugger for Mixed-Integer Programming Solvers
Khalil, Elias B.	LEO: Learning Efficient Orderings for Multiobjective BDDs CaVE: A Cone-aligned Approach for Fast Predict-then-optimize with Binary Linear Programs
Kärcher, Jens	Explainable Algorithm Selection for the Capacitated Lot Sizing Problem
L
Lagnoux, Agnès	Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Lagoon, Vitaly	Single Constant Multiplication for SAT
Lawless, Connor	Fair Minimum Representation Clustering
Le Bodic, Pierre	Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model [BEST STUDENT PAPER]
Leben, Derek	Assessing Group Fairness with Social Welfare Optimization [BEST PAPER]
Legrain, Antoine	An Imitation Learning approach for Personnel Scheduling with flexibility for On-Call Shifts A Benders decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities Online optimization of a dial-a-ride problem with the integral primal simplex
Leyton-Brown, Kevin	UNSAT Solver Synthesis via Monte Carlo Forest Search
Lundy, Taylor	UNSAT Solver Synthesis via Monte Carlo Forest Search
M
Mahmutoğulları, Ali İrfan	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems Task Generalization in Decision-Focused Learning
Mao, Yue	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
McCreesh, Ciaran	Proof Logging for the Circuit Constraint End-to-End Verification for Subgraph Solving
McIlree, Matthew	Proof Logging for the Circuit Constraint
Mendoza, Jorge	A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints
Mexi, Gioni	Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model [BEST STUDENT PAPER]
Meyr, Herbert	Explainable Algorithm Selection for the Capacitated Lot Sizing Problem
Milligan, Alan	UNSAT Solver Synthesis via Monte Carlo Forest Search
Miqueleiz, Imanol	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Moore, Juston	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Muñoz, Gonzalo	Decision-focused predictions via pessimistic bilevel optimization: a computational study
Myreen, Magnus O.	End-to-End Verification for Subgraph Solving
N
Nafar, Mohsen	Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization
Nannicini, Giacomo	Keynote: Optimization and machine learning on quantum computers: yes/no/maybe?
Nguewouo, Franklin	Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem
Nijssen, Siegfried	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems
Niskanen, Andreas	MaxSAT-Based Bi-Objective Boolean Optimization
Nordström, Jakob	Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs Proof Logging for the Circuit Constraint End-to-End Verification for Subgraph Solving
O
Oertel, Andy	Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs End-to-End Verification for Subgraph Solving
Ouali, Abdelkader	Efficiently Mining Closed Interval Patterns with Constraint Programming
P
Pacheco, Felipe	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Parmentier, Axel	Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles
Patel, Rahul	LEO: Learning Efficient Orderings for Multiobjective BDDs
Pavone, Marco	Accelerating Continuous Variable Coherent Ising Machines via Momentum
Pellegrini, Clément	Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Pelsser, Cristel	An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis
Pereira, Felipe de C.	Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches
Pereira, Pierre	Learning to Solve Job Shop Scheduling under Uncertainty
Perron, Laurent	ViolationLS: Constraint-Based Local Search in CP-SAT
Persak, Egon	Learning Deterministic Surrogates for Robust Convex QCQP
Pesant, Gilles	An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems End-to-End Classical Planning using CP and Belief Propagation A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints
Postek, Krzysztof	Improving Metaheuristic Efficiency for Stochastic Optimization Problems by Sequential Predictive Sampling
Puchert, Christian	ULD Build-Up Scheduling with Logic-Based Benders Decomposition
Q
Qu, Zhongdi	Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Quimper, Claude-Guy	Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue
R
Rachelson, Emmanuel	Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Rousseau, Louis Martin	An Imitation Learning approach for Personnel Scheduling with flexibility for On-Call Shifts Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming A data-driven method for constraint customization in optimization models
Roussel, Stephanie	Learning to Solve Job Shop Scheduling under Uncertainty
Römer, Michael	Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization
Rönnberg, Elina	Keynote: Decomposition to tackle large-scale discrete optimisation problems
S
Schaus, Pierre	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis A Constraint Programming Approach for Aircraft Disassembly Scheduling
Schiex, Thomas	Bi-Objective Discrete Graphical Model Optimization
Schindl, David	A Benders decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities
Schutte, Noah	Improving Metaheuristic Efficiency for Stochastic Optimization Problems by Sequential Predictive Sampling
Seipp, Jendrik	End-to-End Classical Planning using CP and Belief Propagation
Semet, Frederic	Decision-focused predictions via pessimistic bilevel optimization: a computational study
Serra, Thiago	Optimization Over Trained Neural Networks: Taking a Relaxing Walk
Shamsi, Somayeh	Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model [BEST STUDENT PAPER]
Silva, Fabiano	A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization
Stuckey, Peter J.	Single Constant Multiplication for SAT
Sumic, Ajdin	SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability
T
Tack, Guido	Single Constant Multiplication for SAT
Takkula, Tuomo	ULD Build-Up Scheduling with Logic-Based Benders Decomposition
Tan, Yong Kiam	End-to-End Verification for Subgraph Solving
Tang, Bo	CaVE: A Cone-aligned Approach for Fast Predict-then-optimize with Binary Linear Programs
Tanneau, Mathieu	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Tax, David M.J.	Learning From Scenarios for Repairable Stochastic Scheduling
Thomas, Charles	A Constraint Programming Approach for Aircraft Disassembly Scheduling
Tong, Jiatai	Optimization Over Trained Neural Networks: Taking a Relaxing Walk
Truong, Tuan	UNSAT Solver Synthesis via Monte Carlo Forest Search
Tsouros, Dimos	Trade-offs in Multi-objective Problems: Finding Top-k Non-dominated Solutions
V
van den Houten, Kim	Learning From Scenarios for Repairable Stochastic Scheduling
Van Hentenryck, Pascal	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Van Meerbeeck, Damien	End-to-End Classical Planning using CP and Belief Propagation
Venturelli, Davide	Accelerating Continuous Variable Coherent Ising Machines via Momentum
Verhaeghe, Hélène	Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches
Vidal, Thibaut	Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming
Vidal, Thierry	SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability
Visentin, Andrea	Explainable Algorithm Selection for the Capacitated Lot Sizing Problem
Véjar, Bastián	Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems
W
Wurm, Adrian	Robustness Verification in Neural Networks
Y
Yin, Chao	An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems
Yorke-Smith, Neil	On Learning CP-SAT Resolution Outcomes Before Reaching Time-Limit Improving Metaheuristic Efficiency for Stochastic Optimization Problems by Sequential Predictive Sampling
Yunes, Tallys	Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches
Z
Zhao, Haoruo	Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification
Zouitine, Mehdi	Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Ó
Ó Gallchóir, Aodh	Explainable Algorithm Selection for the Capacitated Lot Sizing Problem

Disclaimer | Powered by EasyChair Smart Program