東華大學圖書館 |

Integration of AI and OR techniques in constraint programming = 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integration of AI and OR techniques in constraint programming/ edited by Domenico Salvagnin, Michele Lombardi.
其他題名:	14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings /
其他題名:	CPAIOR 2017
其他作者:	Salvagnin, Domenico.
團體作者:	CPAIOR (Conference : 2014-)
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xxiii, 420 p. :ill., digital ;24 cm.
內容註:	Sharpening Constraint Programming approaches for Bit-Vector Theory -- Range-Consistent Forbidden Regions of Allen's Relations -- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints -- On Finding the Optimal Relaxed Decision Diagram -- Design and Implementation of Bounded-Length Sequence Variables -- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles -- Debugging Unsatisfiable Constraint Models -- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization -- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery -- Minimizing Landscape Resistance for Habitat Conservation -- A Hybrid Approach for Stator Winding Design Optimization -- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem -- Explanation-Based-Weighted Degree -- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems -- The Weighted Arborescence Constraint -- Learning When to Use a Decomposition -- Experiments with Conict Analysis in Mixed Integer Programming -- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing -- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations -- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet -- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery -- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks -- Scenario Based Learning for Stochastic Combinatorial Optimization -- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands -- Stochastic Task Networks: Trading Performance for Stability -- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables -- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem -- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond -- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs -- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems.
Contained By:	Springer eBooks
標題:	Constraint programming (Computer science) - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-59776-8
ISBN:	9783319597768

Integration of AI and OR techniques in constraint programming = 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings /
Integration of AI and OR techniques in constraint programming14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings /[electronic resource] :CPAIOR 2017edited by Domenico Salvagnin, Michele Lombardi. - Cham :Springer International Publishing :2017. - xxiii, 420 p. :ill., digital ;24 cm. - Lecture notes in computer science,103350302-9743 ;. - Lecture notes in computer science ;10335..

Sharpening Constraint Programming approaches for Bit-Vector Theory -- Range-Consistent Forbidden Regions of Allen's Relations -- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints -- On Finding the Optimal Relaxed Decision Diagram -- Design and Implementation of Bounded-Length Sequence Variables -- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles -- Debugging Unsatisfiable Constraint Models -- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization -- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery -- Minimizing Landscape Resistance for Habitat Conservation -- A Hybrid Approach for Stator Winding Design Optimization -- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem -- Explanation-Based-Weighted Degree -- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems -- The Weighted Arborescence Constraint -- Learning When to Use a Decomposition -- Experiments with Conict Analysis in Mixed Integer Programming -- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing -- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations -- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet -- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery -- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks -- Scenario Based Learning for Stochastic Combinatorial Optimization -- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands -- Stochastic Task Networks: Trading Performance for Stability -- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables -- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem -- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond -- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs -- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems.

This book constitutes the proceedings of the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2017, held in Padua, Italy, in June 2017. The 32 full papers presented together with 6 abstracts were carefully reviewed and selected from numerous submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

ISBN: 9783319597768

Standard No.: 10.1007/978-3-319-59776-8doiSubjects--Topical Terms:

686627
Constraint programming (Computer science)
--Congresses.

LC Class. No.: QA76.612 / .C63 2017

Dewey Class. No.: 005.116

Integration of AI and OR techniques in constraint programming = 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings /
LDR:04330nmm a2200337 a 4500 001 2100315
003 DE-He213
005 20170530164431.0
006 m d
007 cr nn 008maaau
008 180119s2017 gw s 0 eng d
020 $a 9783319597768 $q (electronic bk.)
020 $a 9783319597751 $q (paper)
024 7 $a 10.1007/978-3-319-59776-8 $2 doi
035 $a 978-3-319-59776-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.612 $b .C63 2017
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.116 $2 23
090 $a QA76.612 $b .C882 2017
111 2 $a CPAIOR (Conference : 2014-) $n (14th : $d 2017 : $c Padua, Italy) $3 3241892
245 1 0 $a Integration of AI and OR techniques in constraint programming $h [electronic resource] : $b 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017 : proceedings / $c edited by Domenico Salvagnin, Michele Lombardi.
246 3 $a CPAIOR 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xxiii, 420 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10335
505 0 $a Sharpening Constraint Programming approaches for Bit-Vector Theory -- Range-Consistent Forbidden Regions of Allen's Relations -- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints -- On Finding the Optimal Relaxed Decision Diagram -- Design and Implementation of Bounded-Length Sequence Variables -- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles -- Debugging Unsatisfiable Constraint Models -- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization -- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery -- Minimizing Landscape Resistance for Habitat Conservation -- A Hybrid Approach for Stator Winding Design Optimization -- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem -- Explanation-Based-Weighted Degree -- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems -- The Weighted Arborescence Constraint -- Learning When to Use a Decomposition -- Experiments with Conict Analysis in Mixed Integer Programming -- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing -- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations -- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet -- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery -- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks -- Scenario Based Learning for Stochastic Combinatorial Optimization -- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands -- Stochastic Task Networks: Trading Performance for Stability -- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables -- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem -- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond -- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs -- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems.
520 $a This book constitutes the proceedings of the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2017, held in Padua, Italy, in June 2017. The 32 full papers presented together with 6 abstracts were carefully reviewed and selected from numerous submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on 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 Computer Science. $3 626642
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Operations Research, Management Science. $3 1532996
700 1 $a Salvagnin, Domenico. $3 3241893
700 1 $a Lombardi, Michele. $3 3241894
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10335. $3 3241895
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-59776-8
950 $a Computer Science (Springer-11645)