Metaheuristics:: Progress as Real Problem Solvers: Operations Research/Computer Science Interfaces Series, cartea 32
Editat de Toshihide Ibaraki, Koji Nonobe, Mutsunori Yagiuraen Limba Engleză Hardback – 6 mai 2005
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 878.05 lei 43-57 zile | |
Springer Us – 8 dec 2010 | 878.05 lei 43-57 zile | |
Hardback (1) | 639.94 lei 43-57 zile | |
Springer Us – 6 mai 2005 | 639.94 lei 43-57 zile |
Din seria Operations Research/Computer Science Interfaces Series
- Preț: 1373.21 lei
- 18% Preț: 1099.00 lei
- 18% Preț: 925.06 lei
- 18% Preț: 1203.52 lei
- 18% Preț: 928.46 lei
- 18% Preț: 1199.70 lei
- 20% Preț: 1706.30 lei
- 18% Preț: 925.68 lei
- 20% Preț: 1263.75 lei
- 18% Preț: 941.76 lei
- 18% Preț: 932.32 lei
- 20% Preț: 1026.63 lei
- 20% Preț: 629.65 lei
- 18% Preț: 925.68 lei
- 20% Preț: 975.89 lei
- 20% Preț: 969.09 lei
- Preț: 371.48 lei
- 18% Preț: 935.28 lei
- 18% Preț: 926.14 lei
- 24% Preț: 908.30 lei
- 18% Preț: 937.91 lei
- 20% Preț: 976.67 lei
- 15% Preț: 633.70 lei
- 20% Preț: 1257.45 lei
- 18% Preț: 930.30 lei
- 15% Preț: 645.56 lei
- 18% Preț: 877.44 lei
Preț: 639.94 lei
Preț vechi: 752.87 lei
-15% Nou
Puncte Express: 960
Preț estimativ în valută:
122.47€ • 127.22$ • 101.73£
122.47€ • 127.22$ • 101.73£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387253824
ISBN-10: 0387253823
Pagini: 414
Ilustrații: XII, 414 p. 106 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.77 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Operations Research/Computer Science Interfaces Series
Locul publicării:New York, NY, United States
ISBN-10: 0387253823
Pagini: 414
Ilustrații: XII, 414 p. 106 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.77 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Operations Research/Computer Science Interfaces Series
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Invited Paper.- Metaheuristic Agent Processes (MAPS).- Tutorial Paper.- GRASP with Path-Relinking: Recent Advances and Applications.- Papers on Problem Solving.- A Tabu Search Heuristic for a University Timetabling Problem.- An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic.- Validation and Optimization of an Elevator Simulation Model with Modern Search Heuristics.- Multi-Objective Hyper-Heuristic Approaches for Space Allocation and Timetabling.- Theory and Practice of the Minimum Shift Design Problem.- Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns.- A Generic Object-Oriented Tabu Search Framework.- Bi-Objective Sequencing of Cutting Patterns.- Metaheuristics Approach for Rule Acquisition in Flexible Shop Scheduling Problems.- Predicting Colorectal Cancer Recurrence: A Hybrid Neural Networks-Based Approach.- A Constructive Genetic Approach to Point-Feature Cartographic Label Placement.- Papers on Methodologies.- Parallel Strategies for Grasp with Path-Relinking.- Speeding Up Local Search Neighborhood Evaluation for A Multi-Dimensional Knapsack Problem.- Computationally Difficult Instances for the Uncapacitated Facility Location Problem.- Consistent Neighbourhood in a Tabu Search.- Constraint Oriented Neighbourhoods — A New Search Strategy in Metaheuristics.
Caracteristici
Surveys some of the most recent solution approaches involving genetic algorithms, simulated annealing, tabu search, evolutionary computation, greedy randomized adaptive search procedures (GRASP), scatter search, ant system, variable neighborhood search, guided local search, iterated local search, noising methods, threshold accepting, memetic algorithms, neural networks, and other hybrid and/or variant approaches for solving hard combinatorial problems