05901nam a22005415i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002400118041000800142050001600150072001600166072002300182082001200205100003600217245027200253260006100525264006100586300003500647336002600682337002600708338003600734347002400770490005800794505219500852520169903047650002204746650002304768650003204791650003004823650002904853650001904882650002204901650002304923650004604946650004704992650004605039650004105085650001905126700002905145710003405174773002005208776003605228830005805264856003705322978-3-540-24664-0DE-He21320141014114341.0cr nn 008mamaa121227s2004 gw | s |||| 0|eng d a97835402466407 a10.1007/b969572doi aeng 4aQA297-299.4 7aUYA2bicssc 7aCOM0513002bisacsh04a5182231 aRégin, Jean-Charles.eeditor.10aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problemsh[electronic resource] :bFirst International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004. Proceedings /cedited by Jean-Charles Régin, Michel Rueher. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. aXIII, 415 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v30110 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. 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. 0aComputer science. 0aComputer software. 0aElectronic data processing. 0aComputational complexity. 0aArtificial intelligence. 0aCombinatorics.14aComputer Science.24aNumeric Computing.24aDiscrete Mathematics in Computer Science.24aAlgorithm Analysis and Problem Complexity.24aArtificial Intelligence (incl. Robotics).24aOperations Research/Decision Theory.24aCombinatorics.1 aRueher, Michel.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540218364 0aLecture Notes in Computer Science,x0302-9743 ;v301140uhttp://dx.doi.org/10.1007/b96957