東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Integration of constraint programming, artificial intelligence, and operations research = 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28-31, 2024 : proceedings.. Part II /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Integration of constraint programming, artificial intelligence, and operations research/ edited by Bistra Dilkina.
Reminder of title:	21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28-31, 2024 : proceedings.
remainder title:	CPAIOR 2024
other author:	Dilkina, Bistra.
corporate name:	CPAIOR (Conference : 2014- )
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xiv, 317 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Constraint programming (Computer science) - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-60599-4
ISBN:	9783031605994

Integration of constraint programming, artificial intelligence, and operations research = 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28-31, 2024 : proceedings.. Part II /
Integration of constraint programming, artificial intelligence, and operations research21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28-31, 2024 : proceedings.Part II /[electronic resource] :CPAIOR 2024edited by Bistra Dilkina. - Cham :Springer Nature Switzerland :2024. - xiv, 317 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,147431611-3349 ;. - Lecture notes in computer science ;14743..

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.

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.

ISBN: 9783031605994

Standard No.: 10.1007/978-3-031-60599-4doiSubjects--Topical Terms:

686627
Constraint programming (Computer science)
--Congresses.

LC Class. No.: QA76.612

Dewey Class. No.: 005.116

Integration of constraint programming, artificial intelligence, and operations research = 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28-31, 2024 : proceedings.. Part II /
LDR:03388nmm a2200349 a 4500 001 2371295
003 DE-He213
005 20240527125503.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031605994 $q (electronic bk.)
020 $a 9783031606014 $q (paper)
024 7 $a 10.1007/978-3-031-60599-4 $2 doi
035 $a 978-3-031-60599-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.612
072 7 $a UYAM $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 005.116 $2 23
090 $a QA76.612 $b .C882 2024
111 2 $a CPAIOR (Conference : 2014- ) $n (21st : $d 2024 : $c Uppsala, Sweden) $3 3717220
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. $n Part II / $c edited by Bistra Dilkina.
246 3 $a CPAIOR 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xiv, 317 p. : $b ill. (some col.), digital ; $c 24 cm.
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 Constraint programming (Computer science) $x Congresses. $3 686627
650 0 $a Combinatorial optimization $x Data processing $v Congresses. $3 844556
650 0 $a Artificial intelligence $v Congresses. $3 606815
650 1 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Computer Communication Networks. $3 775497
700 1 $a Dilkina, Bistra. $3 2093051
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 14743. $3 3717221
856 4 0 $u https://doi.org/10.1007/978-3-031-60599-4
950 $a Computer Science (SpringerNature-11645)