Learn IT - Books tags combinatorial

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 7th International Conference

Springer, 2010

Cutting planes (cuts) are very popular in the OR community, where they are used to strengthen the Linear Programming (LP) relaxation of Mixed-Integer Programs (MIPs) in the hope of improving the performance of an exact LPbased solver. In particular, an intense research effort has been devoted to the study of families of general cuts,...

Optimal Traffic Control: Urban Intersections

CRC Press, 2007

Despite traffic circles, four-way stop signs, lights regulated by timers or sensors, and other methods, the management of urban intersections remains problematic. Consider that transportation systems have all the features of so-called complex systems: the great number of state and control variables, the presence of uncertainty and indeterminism,...

A Guide to Experimental Algorithmics

Cambridge University Press, 2012

Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations, and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I...

Introduction to Piecewise Differentiable Equations (SpringerBriefs in Optimization)

Springer, 2012

This brief provides an elementary introduction to the theory of piecewise differentiable functions with an emphasis on differentiable equations. In the first chapter, two sample problems are used to motivate the study of this theory. The presentation is then developed using two basic tools for the analysis of piecewise differentiable...

Handbook of Mathematical Models in Computer Vision

Springer, 2005

David Marr's theory was a pioneering step towards understanding visual perception.
In his view human vision was based on a complete surface reconstruction
of the environment that was then used to address visual subtasks. This approach
was proven to be insufficient by neuro-biologists and complementary ideas from
statistical...

Graph Theory (Graduate Texts in Mathematics)

Springer, 2007

and guided mainly by the Four-Colour Conjecture. The resolution of the conjecture by K. Appel and W. Haken in 1976, the year in which our first book Graph Theory with Applications appeared, marked a turning point in its history. Since then, the subject has experienced explosive growth, due in large measure to its role as an essential structure...

Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)

Springer, 2006

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and...

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Springer, 2010

For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....

Complexity in Numerical Optimization

World Scientific Publishing, 1993

Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. This volume is a collection of articles on recent complexity developments in numerical...

The Complete Rust Programming Reference Guide: Design, develop, and deploy effective software systems using the advanced constructs of Rust

Packt Publishing, 2019

Design and implement professional-level programs by leveraging modern data structures and algorithms in Rust

Key Features

Improve your productivity by writing more simple and easy code in Rust

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

Graph Algorithms

Cambridge University Press, 2011

Shimon was a great computer scientist who inspired generations of Israeli stutents and young researchers, including many future leaders of theoretical computer science.

He was a master at creating combinatorial algorithms, constructions, and proofs. He always sought the simplest and most lucid solutions. Because...

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Springer, 2005

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

...

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