01630nam2 22003613i 450 CAM000415320170908093317.020120720d1991 ||||0itac50 baitaitz01i xxxe z01nParadiso Dante Alighiericon note introduttive del prof. Raffaello Fornaciari riveduti dal prof. Pietro Scazzosocon le illustrazioni di Aligi SassuMilanoHoeplic1991stampa 2000P. 376 - 577[12] p. di tav.15 cmSul front. : Gente, su licenza Ulrico Hoepli001CAM00041522001 ˜La œDivina CommediaDante Alighiericon note introduttive del prof. Raffaello Fornaciari riveduti dal prof. Pietro Scazzosocon le illustrazioni di Aligi SassuAlighieri, DanteCFIV00873238904Sassu, AligiCFIV000162Scazzoso, PieroPUVV161651Fornaciari, RaffaelloRAVV024465DanteCFIV035565Alighieri, DanteAllighieri, DanteCFIV190967Alighieri, DanteAlighiero, DantePBEV011904Alighieri, DanteAlighieri, Durante : degliSBNV051264Alighieri, DanteFornaciari, RaffaeleSBNV047810Fornaciari, RaffaelloITIT-NA007920120720IT-AV0151CAM0004153Biblioteca del Convento Frati Minori CFB 9.1 65 CF 0000065855 B 1 v.D 2012072020120720 CFParadiso146978UNISANNIO05525nam 22008415 450 991048480300332120251226203348.01-280-85348-497866108534893-540-71615-710.1007/978-3-540-71615-0(CKB)1000000000284093(EBL)3036616(SSID)ssj0000151529(PQKBManifestationID)11151048(PQKBTitleCode)TC0000151529(PQKBWorkID)10318390(PQKB)10395444(DE-He213)978-3-540-71615-0(MiAaPQ)EBC3036616(MiAaPQ)EBC6705737(Au-PeEL)EBL6705737(PPN)123161452(MiAaPQ)EBC302117(BIP)46176052(BIP)14225635(EXLCZ)99100000000028409320100301d2007 u| 0engur|n|---|||||txtccrEvolutionary Computation in Combinatorial Optimization 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings /edited by Carlos Cotta, Jano van Hemert1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (250 p.)Theoretical Computer Science and General Issues,2512-2029 ;4446Description based upon print version of record.3-540-71614-9 Includes bibliographical references and index.A 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.This 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.Theoretical Computer Science and General Issues,2512-2029 ;4446Computer scienceAlgorithmsNumerical analysisComputer scienceMathematicsDiscrete mathematicsTheory of ComputationAlgorithmsNumerical AnalysisDiscrete Mathematics in Computer ScienceComputer science.Algorithms.Numerical analysis.Computer scienceMathematics.Discrete mathematics.Theory of Computation.Algorithms.Numerical Analysis.Discrete Mathematics in Computer Science.006.3823Cotta CarlosVan Hemert JanoEvoCOP (Conference)MiAaPQMiAaPQMiAaPQBOOK9910484803003321Evolutionary Computation in Combinatorial Optimization4206794UNINA