Learn IT - Books tags combinatorial

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Springer, 2012

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...

Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems

John Wiley & Sons, 2008

Although vast activity exists, especially recent, the editors did not find any book that treats applied algorithms in a comprehensive manner. The editors discovered a number of graduate courses in computer science programs with titles such as “Design and Analysis of Algorithms, “Combinatorial Algorithms” “Evolutionary...

Scheduling Algorithms

Springer, 2007

From the reviews of the fourth edition:

"This is a book about scheduling algorithms. … The book contains eleven chapters. … Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and...

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing

John Wiley & Sons, 1989

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide...

Multi-Objective Optimization in Computer Networks Using Metaheuristics

Auerbach Publications, 2007

Many new multicast applications emerging from the Internet, such as Voice-over-IP (VoIP), videoconference, TV over the Internet, radio over the Internet, video streaming multipoint, etc., have the following resource requirements: bandwidth consumption, end-to-end delay, delay jitter, packet loss ratio, and so forth. It is therefore necessary to...

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

Springer, 2005

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms...

Thirty Essays on Geometric Graph Theory (Algorithms and Combinatorics)

Springer, 2013

In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial...

Flexibility and Robustness in Scheduling

John Wiley & Sons, 2008

Scheduling is a broad research area and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and...

Hands-On Data Structures and Algorithms with Rust: Learn programming techniques to build effective, maintainable, and readable code in Rust 2018

Packt Publishing, 2019

Design and implement efficient programs by exploring modern Rust data structures and algorithms

Key Features

Use data structures such as arrays, stacks, trees, lists, and graphs with real-world examples

Learn the functional and reactive implementations of traditional data...

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Springer, 2011

This volume contains the papers presented at the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011) and the 15th International Workshop on Randomization and Computation (RANDOM 2011), which took place concurrently in Princeton University, USA, during August 17–19,...

Advances in Bio-inspired Computing for Combinatorial Optimization Problems (Intelligent Systems Reference Library)

Springer, 2013

"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.

Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the...

Bio-inspired Algorithms for the Vehicle Routing Problem (Studies in Computational Intelligence)

Springer, 2008

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered demands. Biological inspired computation is a field devoted to the development of computational tools modeled after...

Result Page: 13 12 11 10 9 8 7 6 5 4 3 2 1