LEADER 05619nam 22008895 450 001 996465998703316 005 20230221174622.0 010 $a1-280-94921-X 010 $a9786610949212 010 $a3-540-72397-8 024 7 $a10.1007/978-3-540-72397-4 035 $a(CKB)1000000000490698 035 $a(EBL)3061559 035 $a(SSID)ssj0000299888 035 $a(PQKBManifestationID)11947467 035 $a(PQKBTitleCode)TC0000299888 035 $a(PQKBWorkID)10241883 035 $a(PQKB)11398837 035 $a(DE-He213)978-3-540-72397-4 035 $a(MiAaPQ)EBC3061559 035 $a(MiAaPQ)EBC6742878 035 $a(Au-PeEL)EBL6742878 035 $a(OCoLC)184986501 035 $a(PPN)123162165 035 $a(EXLCZ)991000000000490698 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems$b[electronic resource] $e4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings /$fedited by Pascal Van Hentenryck, Laurence Wolsey 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (399 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4510 300 $aDescription based upon print version of record. 311 $a3-540-72396-X 320 $aIncludes bibliographical references and index. 327 $aMinimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The ?Not-Too-Heavy Spanning Tree? Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender?s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. 330 $aThis book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007. The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4510 606 $aArtificial intelligence 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aOperations research 606 $aArtificial Intelligence 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aOperations Research and Decision Theory 606 $aDiscrete Mathematics 615 0$aArtificial intelligence. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aOperations research. 615 14$aArtificial Intelligence. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aOperations Research and Decision Theory. 615 24$aDiscrete Mathematics. 676 $a658.53 702 $aVan Hentenryck$b Pascal 702 $aWolsey$b Laurence A. 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 $a996465998703316 996 $aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems$9771927 997 $aUNISA