LEADER 02328nam a2200373 i 4500 001 991001856739707536 008 080714s2008 mauab b 001 0 eng d 020 $a9780072982398 035 $ab1408174x-39ule_inst 040 $aDip.to Ingegneria dell'Innovazione$beng 082 0 $a658.5$222 100 1 $aSimchi-Levi, David$0477648 245 10$aDesigning and managing the supply chain :$bconcepts, strategies, and case studies /$cDavid Simchi-Levi, Philip Kaminsky, Edith Simchi-Levi 250 $a3rd ed. 260 $aBoston :$bMcGraw-Hill/Irwin,$cc2008 300 $axxviii, 498 p. :$bill., maps ;$c27 cm. +$e1 CD-ROM 440 0$aMcgraw-Hill/Irwin series operations and decision sciences 504 $aIncludes bibliographical references and index 538 $aSystem requirements for accompanying CD-ROM: Microsoft Windows 2000/XP/Vista; minimum 256 MB main memory, 512 recommended; 10 MB or better free hard disk space; Microsoft Excel 2000 or better; Microsoft Internet Explorer 6 or better. An active Internet connection is also required to access some of the Web pages that are linked from this CD. 650 4$aPhysical distribution of goods$xManagement 650 4$aMarketing channels$xManagement 650 4$aBusiness logistics 700 1 $aKaminsky, Philip$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0595338 700 1 $aSimchi-Levi, Edith$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0732224 856 41$3Table of contents only$uhttp://www.loc.gov/catdir/toc/ecip0712/2007009107.html 907 $a.b1408174x$b28-01-14$c16-10-12 912 $a991001856739707536 945 $aLE026 658.5 D SIM 01.01 C.1 2008$cC.1$g1$i2026000043593$lle026$nProf. Elia / Biblioteca$op$pE89.78$q-$rn$s- $t1$u0$v0$w0$x0$y.i15448174$z16-10-12 945 $aLE026 658.5 D SIM 01.01 C.2 2008$cC.2$g1$i2026000043609$lle026$nProf. Elia / Biblioteca$op$pE89.78$q-$rl$s- $t0$u1$v0$w1$x0$y.i15448186$z16-10-12 945 $aLE026 cd-rom n.330$cC.1 cd$g1$i2026000062013$lle026$o-$pE0.00$q-$rn$s- $t1$u0$v0$w0$x0$y.i15448228$z16-10-12 945 $aLE026 cd-rom n.331$cC.2 cd$g1$i2026000062006$lle026$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i1544823x$z16-10-12 996 $aDesigning and managing the supply chain$91442596 997 $aUNISALENTO 998 $ale026$b14-07-08$cm$da $e-$feng$gmau$h0$i0 LEADER 01618oam 2200421Ia 450 001 9910696378203321 005 20220715131824.0 035 $a(CKB)5470000002377047 035 $a(OCoLC)180703824 035 $a(EXLCZ)995470000002377047 100 $a20071105d2007 ua 0 101 0 $aeng 135 $aurmn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aChemical data for rock, sediment, biological, precipitate, and water samples from abandoned copper mines in Prince William Sound, Alaska$b[electronic resource] /$fedited by Randolph A. Koski and LeeAnn Munk 205 $aVersion 1.0. 210 1$aReston, Va. :$cU.S. Geological Survey,$d2007. 215 $aiv, 16 pages $cdigital, PDF file 225 1 $aOpen-file report ;$v2007-1359 300 $aTitle from PDF title screen (viewed on Nov. 5, 2007). 320 $aIncludes bibliographical references (pages 14-16). 606 $aAcid mine drainage$zAlaska$zPrince William Sound 606 $aAbandoned mines$xEnvironmental aspects$zAlaska$zPrince William Sound 615 0$aAcid mine drainage 615 0$aAbandoned mines$xEnvironmental aspects 701 $aKoski$b Randolph A$01383932 701 $aMunk$b LeeAnn$01405160 712 02$aGeological Survey (U.S.) 801 0$bGIS 801 1$bGIS 801 2$bRLA 801 2$bGPO 906 $aBOOK 912 $a9910696378203321 996 $aChemical data for rock, sediment, biological, precipitate, and water samples from abandoned copper mines in Prince William Sound, Alaska$93481169 997 $aUNINA LEADER 05321nam 2200673Ia 450 001 9911019981403321 005 20230124183445.0 010 $a1-282-68408-6 010 $a9786612684081 010 $a0-470-61182-0 010 $a0-470-61038-7 035 $a(CKB)2550000000002151 035 $a(EBL)477681 035 $a(OCoLC)520990483 035 $a(SSID)ssj0000354063 035 $a(PQKBManifestationID)11245273 035 $a(PQKBTitleCode)TC0000354063 035 $a(PQKBWorkID)10302232 035 $a(PQKB)11736115 035 $a(MiAaPQ)EBC477681 035 $a(MiAaPQ)EBC4434314 035 $a(EXLCZ)992550000000002151 100 $a20090421d2009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aConstraint networks$b[electronic resource] $etechniques and algorithms /$fChristophe Lecoutre 210 $aLondon $cISTE ;$aHoboken, NJ $cJohn Wiley & Sons$d2009 215 $a1 online resource (588 p.) 225 1 $aISTE ;$vv.143 300 $aDescription based upon print version of record. 311 $a1-84821-106-6 320 $aIncludes bibliographical references and index. 327 $aConstraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods 327 $a1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 327 $a2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies 327 $aChapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 327 $a4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 327 $a5.3.3. Compressed tables 330 $aA major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book provides an accessible synthesis of the author's research and work in this area, divided into four main topics: representation, inference, search, and learning. The results obtained and reproduced in this book have a wide applicability, regardless of the nature of the problem or the constraints involved, making it an extremely user-friendly resource for those involved in this field. 410 0$aISTE 606 $aConstraint programming (Computer science) 606 $aComputer algorithms 606 $aComputer networks 615 0$aConstraint programming (Computer science) 615 0$aComputer algorithms. 615 0$aComputer networks. 676 $a004.6 676 $a005.116 700 $aLecoutre$b Christophe$01838221 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911019981403321 996 $aConstraint networks$94417158 997 $aUNINA