000 05615nam a22006495i 4500
001 978-3-319-59776-8
003 DE-He213
005 20240423125300.0
007 cr nn 008mamaa
008 170530s2017 sz | s |||| 0|eng d
020 _a9783319597768
_9978-3-319-59776-8
024 7 _a10.1007/978-3-319-59776-8
_2doi
050 4 _aQA297-299.4
072 7 _aPBKS
_2bicssc
072 7 _aMAT041000
_2bisacsh
072 7 _aPBKS
_2thema
082 0 4 _a518
_223
245 1 0 _aIntegration of AI and OR Techniques in Constraint Programming
_h[electronic resource] :
_b14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings /
_cedited by Domenico Salvagnin, Michele Lombardi.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXXIII, 420 p. 78 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10335
505 0 _aSharpening 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 WeightedArborescence 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 toSolve 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 _aThis 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 _aNumerical analysis.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence.
650 0 _aOperations research.
650 0 _aManagement science.
650 1 4 _aNumerical Analysis.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
650 2 4 _aArtificial Intelligence.
650 2 4 _aOperations Research, Management Science.
700 1 _aSalvagnin, Domenico.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLombardi, Michele.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319597751
776 0 8 _iPrinted edition:
_z9783319597775
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10335
856 4 0 _uhttps://doi.org/10.1007/978-3-319-59776-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176245
_d176245