Integration of Constraint Programming, Artificial Intelligence, and Operations Research 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part II /

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 proceedin...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
مؤلف مشترك: SpringerLink (Online service)
مؤلفون آخرون: Dilkina, Bistra (المحرر)
التنسيق: الكتروني كتاب الكتروني
اللغة:الإنجليزية
منشور في: Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
الطبعة:1st ed. 2024.
سلاسل:Lecture Notes in Computer Science, 14743
الموضوعات:
الوصول للمادة أونلاين:https://doi.org/10.1007/978-3-031-60599-4
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-60599-4
003 DE-He213
005 20251225202053.0
007 cr nn 008mamaa
008 240527s2024 sz | s |||| 0|eng d
020 |a 9783031605994  |9 978-3-031-60599-4 
024 7 |a 10.1007/978-3-031-60599-4  |2 doi 
050 4 |a QA76.9.M35 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Integration of Constraint Programming, Artificial Intelligence, and Operations Research  |h [electronic resource] :  |b 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part II /  |c edited by Bistra Dilkina. 
250 |a 1st ed. 2024. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2024. 
300 |a XIV, 317 p. 79 illus., 62 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14743 
505 0 |a 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. 
520 |a 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. . 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Artificial intelligence. 
650 0 |a Computer science. 
650 0 |a Computer networks . 
650 1 4 |a Mathematics of Computing. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Computer Communication Networks. 
700 1 |a Dilkina, Bistra.  |e editor.  |0 (orcid)0000-0002-6784-473X  |1 https://orcid.org/0000-0002-6784-473X  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031606014 
776 0 8 |i Printed edition:  |z 9783031606007 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14743 
856 4 0 |u https://doi.org/10.1007/978-3-031-60599-4 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)