Evolutionary Computation in Combinatorial Optimization, Gabriela Ochoa; Francisco Chicano

Автор: Peter I. Cowling; Peter Merz
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642121381 ISBN-13(EAN): 9783642121388
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, held in Instanbul, Turkey, in April 2010. This book discusses developments and applications in metaheuristics.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Название: Combinatorial optimization and applications
ISBN: 3642020259 ISBN-13(EAN): 9783642020254
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Автор: T-H. Hubert Chan; Minming Li; Lusheng Wang
Название: Combinatorial Optimization and Applications
ISBN: 3319487485 ISBN-13(EAN): 9783319487489
Издательство: Springer
Рейтинг:
Цена: 91310.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions.

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 1107007518 ISBN-13(EAN): 9781107007512
Издательство: Cambridge Academ
Рейтинг:
Цена: 85530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows.

Автор: Cerulli
Название: Combinatorial Optimization
ISBN: 3319455869 ISBN-13(EAN): 9783319455860
Издательство: Springer
Рейтинг:
Цена: 61490.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity;

Автор: Friedrich Eisenbrand; Jochen Koenemann
Название: Integer Programming and Combinatorial Optimization
ISBN: 3319592491 ISBN-13(EAN): 9783319592497
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017.

Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi
Название: Combinatorial Optimization and Graph Algorithms
ISBN: 9811061467 ISBN-13(EAN): 9789811061462
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.

Автор: Jon Lee; Jens Vygen
Название: Integer Programming and Combinatorial Optimization
ISBN: 331907556X ISBN-13(EAN): 9783319075563
Издательство: Springer
Рейтинг:
Цена: 77320.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014.

Автор: Bin Hu; Manuel L?pez-Ib??ez
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3319554522 ISBN-13(EAN): 9783319554525
Издательство: Springer
Рейтинг:
Цена: 51230.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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

Автор: Francisco Chicano; Bin Hu; Pablo Garc?a-S?nchez
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3319306979 ISBN-13(EAN): 9783319306971
Издательство: Springer
Рейтинг:
Цена: 46590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery.- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations.- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem.- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization.- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems.- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance.- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limits to Learning in Reinforcement Learning Hyperheuristics.- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition.- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity.- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization.