Vor Ort
Merkzettel Warenkorb
  • Produktbild: Evolutionary Computation in Combinatorial Optimization
  • Produktbild: Evolutionary Computation in Combinatorial Optimization

Evolutionary Computation in Combinatorial Optimization 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings

Aus der Reihe Lecture Notes in Computer Science

46,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.03.2013

Herausgeber

Martin Middendorf + weitere

Verlag

Springer Berlin

Seitenzahl

275

Maße (L/B/H)

23,5/15,5/1,6 cm

Gewicht

441 g

Auflage

2013

Sprache

Englisch

ISBN

978-3-642-37197-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.03.2013

Herausgeber

Verlag

Springer Berlin

Seitenzahl

275

Maße (L/B/H)

23,5/15,5/1,6 cm

Gewicht

441 g

Auflage

2013

Sprache

Englisch

ISBN

978-3-642-37197-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Evolutionary Computation in Combinatorial Optimization
  • Produktbild: Evolutionary Computation in Combinatorial Optimization
  • A Hyper-heuristic with a Round Robin Neighbourhood.- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks.- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory.- A New Crossover for Solving Constraint Satisfaction Problems.- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs.- A Study of Adaptive Perturbation Strategy for Iterated Local Search.- Adaptive MOEA/D for QoS-Based Web Service Composition.- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem.- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem.- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis.- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach.- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem.- Dynamic Evolutionary Membrane Algorithm in Dynamic Environments.- From Sequential to Parallel Local Search for SAT.- Generalizing Hyper-heuristics via Apprenticeship Learning.- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem.- Investigating Monte-Carlo Methods on the Weak Schur Problem.- Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches.- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape.- Single Line Train Scheduling with ACO.- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search.- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent.- The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing.