Integration of Constraint Programming, Artificial Intelligence, and Operations Research

21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part II

AvBistra Dilkina

Häftad, Engelska, 2024

Del 14743 i serien Lecture Notes in Computer Science

967 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the proceedings of the 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2024, held in Uppsala, Sweden, during May 28–31, 2024.The 33 full papers and the 9 short papers presented in the proceedings were carefully reviewed and selected from a total of 104 submissions.The content of the papers focus on new techniques or applications in the area and foster the integration of techniques from different fields dealing with large and complex problems.

Produktinformation

Utgivningsdatum:2024-05-28
Mått:155 x 235 x 19 mm
Vikt:505 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:317
Förlag:Springer International Publishing AG
ISBN:9783031606014

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

Core Boosting in SAT-Based Multi-Objective Optimization.- Fair Minimum Representation Clustering.- Proof Logging for the Circuit Constraint.- Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model.- Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization.- LEO: Learning Efficient Orderings for Multiobjective BDDs.- Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches.- Learning Deterministic Surrogates for Robust Convex QCQP.- Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin.- Improving Metaheuristic Effciency for Stochastic Optimization Problems by Sequential Predictive Sampling.- SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability.- CaVE: A Cone-aligned Approach for Fast Predict-then-optimize with Binary Linear Programs.- A Constraint Programming Approach for Aircraft Disassembly Scheduling.- Optimization Over Trained Neural Networks: Taking a Relaxing Walk.- Learning From Scenarios for Repairable Stochastic Scheduling.- Explainable Algorithm Selection for the Capacitated Lot Sizing Problem.- Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems.- Robustness Verification in Neural Networks.- An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems.- Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification.- Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs.