LEADER 01355nam 2200349 n 450 001 996385770703316 005 20221107225818.0 035 $a(CKB)1000000000602713 035 $a(EEBO)2240891872 035 $a(UnM)99853944 035 $a(EXLCZ)991000000000602713 100 $a19920707d1622 uy | 101 0 $alat 135 $aurbn||||a|bb| 200 10$aTheses philosophicae$b[electronic resource] $equas Dei opt. max. ductu, & auspiciis, ad diem 4. kal. Augusti, Edinburgi, in æde sacra australi, propugnabunt adolescentes magisterii candidati, ex academia Iacobi Regis, hoc anno 1622. cum laurea emittendi. Præside Iacobo Reido, primæ philosphiæ professore 210 $aEdinburgi $cExcudebant hæredes Andreæ Hart$d1622 215 $a[52] p 300 $aSignatures: [par.]² A-Fâ´. 300 $aFormerly STC 20859. 300 $aIdentified as STC 20859 on UMI microfilm reel 1556.. 300 $aImperfect; leaf [par.]¹ torn, affecting text on verso. 300 $aReproduction of the original in the Bodleian Library. 330 $aeebo-0014 700 $aReid$b James$cRegent of Edinburgh University.$097485 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996385770703316 996 $aTheses philosophicae$92300284 997 $aUNISA LEADER 07095nam 22008655 450 001 9910144194503321 005 20230810201019.0 010 $a1-280-30804-4 010 $a9786610308040 010 $a3-540-24664-9 024 7 $a10.1007/b96957 035 $a(CKB)1000000000212356 035 $a(DE-He213)978-3-540-24664-0 035 $a(SSID)ssj0000180405 035 $a(PQKBManifestationID)11170725 035 $a(PQKBTitleCode)TC0000180405 035 $a(PQKBWorkID)10149581 035 $a(PQKB)10658226 035 $a(MiAaPQ)EBC3087571 035 $a(PPN)15522333X 035 $a(EXLCZ)991000000000212356 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems $eFirst International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings /$fedited by Jean-Charles Régin, Michel Rueher 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIII, 415 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v3011 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-21836-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Paper -- Using MILP and CP for the Scheduling of Batch Chemical Processes -- Technical Papers -- SIMPL: A System for Integrating Optimization Techniques -- A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times -- Simple Rules for Low-Knowledge Algorithm Selection -- Filtering Algorithms for the Same Constraint -- Cost Evaluation of Soft Global Constraints -- SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems -- Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming -- Generating Benders Cuts for a General Class of Integer Programming Problems -- A Constraint Programming Model for Tail Assignment -- Super Solutions in Constraint Programming -- Local Probing Applied to Network Routing -- Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights -- Filtering Methods for Symmetric Cardinality Constraint -- Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints -- Combining Forces to Solve the Car Sequencing Problem -- Travelling in the World of Local Searches in the Space of Partial Assignments -- A Global Constraint for Nesting Problems -- Models and Symmetry Breaking for ?Peaceable Armies of Queens? -- A Global Constraint for Graph Isomorphism Problems -- Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem -- Scheduling Abstractions for Local Search -- O(nlog n) Filtering Algorithms for Unary Resource Constraint -- Problem Decomposition for Traffic Diversions -- Short Papers -- LP Relaxations of Multiple all_different Predicates -- Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming -- Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework -- The Challenge of Generating Spatially Balanced Scientific Experiment Designs -- Building Models through Formal Specification -- Stabilization Issues for Constraint Programming Based Column Generation -- A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. 330 $aThis volume contains the proceedings of the First International Conference on IntegrationofAIandORTechniquesinConstraintProgrammingforCombina- rialOptimisation Problems.This new conferencefollows the seriesof CP-AI-OR International Workshops on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems held in Ferrara (1999), Paderborn (2000), Ashford (2001), Le Croisic (2002), and Montreal (2003). The success of the previous workshops has demonstrated that CP-AI-OR is bec- ing a major forum for exchanging ideas and methodologiesfrom both ?elds. The aim of this new conference is to bring together researchersfrom AI and OR, and to give them the opportunity to show how the integration of techniques from AI and OR can lead to interesting results on large scale and complex problems. The integration of techniques from Arti?cial Intelligence and Operations - search has provided e?ective algorithms for tackling complex and large scale combinatorial problems with signi?cant improvements in terms of e?ciency, scalability and optimality. The bene?t of this integration has been shown in applications such as hoist scheduling, rostering, dynamic scheduling and vehicle routing. At the programming and modelling levels, most constraint languages embed OR techniques to reason about collections of constraints, so-calledglobal constraints. Some languages also provide support for hybridization allowing the programmer to build new integrated algorithms. The resulting multi-paradigm programmingframeworkcombines the ?exibility and modelling facilities of C- straint Programming with the special purpose and e?cient methods from - erations Research. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v3011 606 $aSoftware engineering 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence 606 $aOperations research 606 $aSoftware Engineering 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aOperations Research and Decision Theory 615 0$aSoftware engineering. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aOperations research. 615 14$aSoftware Engineering. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aOperations Research and Decision Theory. 676 $a005.1/16 702 $aRégin$b Jean-Charles$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRueher$b Michel$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144194503321 996 $aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems$9771927 997 $aUNINA