LEADER 01162nam0 22002893i 450 001 SUN0090626 005 20120725115031.374 010 $a88-7187-681-4 100 $a20120725d1996 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aOrganizzare la qualità nei servizi$eun modello per l'eccellenza nelle imprese e negli enti di servizi$f Giuseppe Negro$gpresentazione di Alberto Galgano 205 $a2. ed 210 $dMilano : Il sole 24 ore$d1996 215 $a339 p.$d22 cm. 606 $aAziende di servizi$2FI$3SUNC014175 620 $dMilano$3SUNL000284 700 1$aNegro$b, Giuseppe$3SUNV073544$0116779 702 1$aGalgano$b, Alberto$3SUNV011759 712 $aIl sole 24 ore$3SUNV001053$4650 801 $aIT$bSOL$c20181109$gRICA 912 $aSUN0090626 950 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI ECONOMIA$d03 PREST IIAn7 $e03 30300 995 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI ECONOMIA$bIT-CE0106$h30300$kPREST IIAn7$op$qa 996 $aOrganizzare la qualità nei servizi$9197503 997 $aUNICAMPANIA LEADER 05525nam 22008415 450 001 9910484803003321 005 20251226203348.0 010 $a1-280-85348-4 010 $a9786610853489 010 $a3-540-71615-7 024 7 $a10.1007/978-3-540-71615-0 035 $a(CKB)1000000000284093 035 $a(EBL)3036616 035 $a(SSID)ssj0000151529 035 $a(PQKBManifestationID)11151048 035 $a(PQKBTitleCode)TC0000151529 035 $a(PQKBWorkID)10318390 035 $a(PQKB)10395444 035 $a(DE-He213)978-3-540-71615-0 035 $a(MiAaPQ)EBC3036616 035 $a(MiAaPQ)EBC6705737 035 $a(Au-PeEL)EBL6705737 035 $a(PPN)123161452 035 $a(MiAaPQ)EBC302117 035 $a(BIP)46176052 035 $a(BIP)14225635 035 $a(EXLCZ)991000000000284093 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aEvolutionary Computation in Combinatorial Optimization $e7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings /$fedited by Carlos Cotta, Jano van Hemert 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (250 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4446 300 $aDescription based upon print version of record. 311 08$a3-540-71614-9 320 $aIncludes bibliographical references and index. 327 $aA New Local Search Algorithm for the DNA Fragment Assembly Problem -- A Hybrid Immune-Based System for the Protein Folding Problem -- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem -- Genetic Algorithms for Word Problems in Partially Commutative Groups -- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling -- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges -- Iterated k-Opt Local Search for the Maximum Clique Problem -- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem -- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks -- A New Metaheuristic for the Vehicle Routing Problem with Split Demands -- Generation of Tree Decompositions by Iterated Local Search -- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem -- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms -- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem -- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem -- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling -- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics -- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem -- A Hybrid Method for Solving Large-Scale Supply Chain Problems -- Crossover Operators for the Car Sequencing Problem. 330 $aThis book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers presented were carefully reviewed and selected from 81 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers are specifically dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems and cover any issue of metaheuristic for combinatorial optimization. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4446 606 $aComputer science 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 676 $a006.3823 702 $aCotta$b Carlos 702 $aVan Hemert$b Jano 712 12$aEvoCOP (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484803003321 996 $aEvolutionary Computation in Combinatorial Optimization$94206794 997 $aUNINA