國立虎尾科技大學 |

Integration of Constraint Programming, Artificial Intelligence, and Operations Research = 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Integration of Constraint Programming, Artificial Intelligence, and Operations Research/ edited by Louis-Martin Rousseau, Kostas Stergiou.
其他題名:	16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings /
其他作者:	Rousseau, Louis-Martin.
面頁冊數:	XX, 662 p. 389 illus., 91 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Numerical analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-19212-9
ISBN:	9783030192129

Integration of Constraint Programming, Artificial Intelligence, and Operations Research = 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings /
Integration of Constraint Programming, Artificial Intelligence, and Operations Research16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings /[electronic resource] :edited by Louis-Martin Rousseau, Kostas Stergiou. - 1st ed. 2019. - XX, 662 p. 389 illus., 91 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11494. - Theoretical Computer Science and General Issues ;9163.

Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.

This book constitutes the proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019, held in Thessaloniki, Greece, in June 2019. The 34 full papers presented together with 9 short papers were carefully reviewed and selected from 94 submissions. The conference brings together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

ISBN: 9783030192129

Standard No.: 10.1007/978-3-030-19212-9doiSubjects--Topical Terms:

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Integration of Constraint Programming, Artificial Intelligence, and Operations Research = 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings /
LDR:05441nam a22004095i 4500 001 1010379
003 DE-He213
005 20200703082800.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030192129 $9 978-3-030-19212-9
024 7 $a 10.1007/978-3-030-19212-9 $2 doi
035 $a 978-3-030-19212-9
050 4 $a QA297-299.4
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Integration of Constraint Programming, Artificial Intelligence, and Operations Research $h [electronic resource] : $b 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings / $c edited by Louis-Martin Rousseau, Kostas Stergiou.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XX, 662 p. 389 illus., 91 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 Theoretical Computer Science and General Issues ; $v 11494
505 0 $a Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.
520 $a This book constitutes the proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019, held in Thessaloniki, Greece, in June 2019. The 34 full papers presented together with 9 short papers were carefully reviewed and selected from 94 submissions. The conference brings together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.
650 0 $a Numerical analysis. $3 527939
650 0 $a Artificial intelligence. $3 559380
650 0 $a Algorithms. $3 527865
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computers. $3 565115
650 1 4 $a Numeric Computing. $3 669943
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Models and Principles. $3 669634
700 1 $a Rousseau, Louis-Martin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304456
700 1 $a Stergiou, Kostas. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304457
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030192112
776 0 8 $i Printed edition: $z 9783030192136
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-19212-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)