LEADER 07379nam 22007935 450 001 9910483327903321 005 20230406044647.0 010 $a3-540-68155-8 024 7 $a10.1007/978-3-540-68155-7 035 $a(CKB)1000000000440594 035 $a(SSID)ssj0000318354 035 $a(PQKBManifestationID)11265158 035 $a(PQKBTitleCode)TC0000318354 035 $a(PQKBWorkID)10310237 035 $a(PQKB)10874080 035 $a(DE-He213)978-3-540-68155-7 035 $a(MiAaPQ)EBC3068693 035 $a(PPN)127048081 035 $a(EXLCZ)991000000000440594 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems$b[electronic resource] $e5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings /$fedited by Laurent Perron, Michael A. Trick 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XII, 394 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5015 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-68154-X 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Airline Scheduling: Accomplishments, Opportunities and Challenges -- Selected Challenges from Distribution and Commerce in the Airline and Travel Industry -- 30 Years of Constraint Programming -- Long Papers -- Constraint Integer Programming: A New Approach to Integrate CP and MIP -- New Filtering for the Constraint in the Context of Non-Overlapping Rectangles -- Multi-stage Benders Decomposition for Optimizing Multicore Architectures -- Fast and Scalable Domino Portrait Generation -- Gap Reduction Techniques for Online Stochastic Project Scheduling -- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver -- Cost Propagation ? Numerical Propagation for Optimization Problems -- Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs -- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting -- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems -- A Novel Approach For Detecting Symmetries in CSP Models -- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization -- Optimal Deployment of Eventually-Serializable Data Services -- Counting Solutions of Knapsack Constraints -- From High-Level Model to Branch-and-Price Solution in G12 -- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint -- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic -- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection -- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts -- A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems -- Solving a Log-Truck Scheduling Problem with Constraint Programming -- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints -- Connections in Networks: A Hybrid Approach -- Efficient Haplotype Inference with Combined CP and OR Techniques -- Integration of CP and Compilation Techniques for Instruction Sequence Test Generation -- Propagating Separable Equalities in an MDD Store -- The Weighted Cfg Constraint -- CP with ACO -- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract) -- Constraint Optimization and Abstraction for Embedded Intelligent Systems -- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs -- Guiding Stochastic Search by Dynamic Learning of the Problem Topography -- Hybrid Variants for Iterative Flattening Search -- Global Propagation of Practicability Constraints -- The Polytope of Tree-Structured Binary Constraint Satisfaction Problems -- A Tabu Search Method for Interval Constraints -- The Steel Mill Slab Design Problem Revisited -- Filtering Atmost1 on Pairs of Set Variables -- Extended Abstract -- Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints. 330 $aThe 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20?23, 2008. The purpose of this conference series is to bring together researchers in the ?elds of constraint programming, arti?cial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the ?elds? di?erent techniques. Through the years, this research community is discovering that the ?elds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of ?elds. This year, we allowed submissions of both long (15 page) and short (5 page) papers, with short papers either being original work, a reduced version of a long paper, or an extended abstract of work published elsewhere. We were not s- prised by the 69 submissions in the long paper category: this is an active ?eld with many researchers. We were surprised by the 61 short paper submissions. This was far more than predicted. With 130 high-quality submissions, compe- tion for acceptance in this year?s program was particularly ?erce. In the end, we accepted 18 long papers and 22 short papers for presentation and publication in this volume. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5015 606 $aComputer science 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence 606 $aOperations research 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aOperations Research and Decision Theory 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aOperations research. 615 14$aTheory of Computation. 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 $a006.3 702 $aPerron$b Laurent$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTrick$b Michael A$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483327903321 996 $aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems$9771927 997 $aUNINA LEADER 01190nam 2200421 450 001 9910823177403321 005 20200520144314.0 010 $a1-925495-68-X 035 $a(CKB)4100000007387145 035 $a(MiAaPQ)EBC5627953 035 $a(Au-PeEL)EBL5627953 035 $a(CaPaEBR)ebr11642866 035 $a(OCoLC)1082256726 035 $a(EXLCZ)994100000007387145 100 $a20190220d2018 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aAntipodean perspective $eselected writings of Bernard Smith /$fedited by Rex Butler and Bernard Smith 210 1$aClayton, Victoria :$cMonash University Publishing,$d[2018] 210 4$d2018 215 $a1 online resource (xxiv, 401 pages) 606 $aArt 606 $aArt, Australian 615 0$aArt. 615 0$aArt, Australian. 676 $a709.24 702 $aButler$b Rex 702 $aSmith$b Bernard$f1916-2011, 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910823177403321 996 $aAntipodean perspective$94058130 997 $aUNINA