Evolutionary Computation in Combinatorial Optimization: Lecture Notes in Computer Science, cartea 10197
Editat de Bin Hu, Manuel López-Ibáñezen Limba Engleză Paperback – 10 mar 2017
Din seria Lecture Notes in Computer Science
- 20%
Preț: 733.68 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 449.81 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 850.42 lei - 20%
Preț: 386.08 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 620.33 lei - 20%
Preț: 620.33 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 435.28 lei - 20%
Preț: 748.63 lei - 20%
Preț: 633.70 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 675.83 lei - 20%
Preț: 678.21 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 560.93 lei - 20%
Preț: 556.96 lei - 20%
Preț: 313.10 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 563.29 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 20%
Preț: 562.49 lei - 15%
Preț: 672.87 lei - 20%
Preț: 571.88 lei - 20%
Preț: 478.59 lei - 20%
Preț: 984.64 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei - 20%
Preț: 313.87 lei - 20%
Preț: 314.86 lei - 20%
Preț: 793.92 lei - 18%
Preț: 945.44 lei
Preț: 374.09 lei
Puncte Express: 561
Preț estimativ în valută:
66.15€ • 75.86$ • 57.17£
66.15€ • 75.86$ • 57.17£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783319554525
ISBN-10: 3319554522
Pagini: 264
Ilustrații: XII, 249 p. 46 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3319554522
Pagini: 264
Ilustrații: XII, 249 p. 46 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives.- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem.- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search.- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling.- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When.- Decomposing SAT Instances with Pseudo Backbones.- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control.- Estimation of Distribution Algorithms for the Firefighter Problem.- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows.- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO.- Optimizing Charging Station Locations for Electric Car-Sharing Systems.- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier.- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants.- The Weighted Independent Domination Problem: ILP Model and Algorithmic
Caracteristici
Includes supplementary material: sn.pub/extras