Wiley Series in Discrete Mathematics & Optimization - Böcker
Visar alla böcker i serien Wiley Series in Discrete Mathematics & Optimization. Handla med fri frakt och snabb leverans.
29 produkter
29 produkter
Del 45 - Wiley Series in Discrete Mathematics & Optimization
Cellular Automata
A Discrete View of the World
Inbunden, Engelska, 2008
1 759 kr
Skickas inom 7-10 vardagar
An accessible and multidisciplinaryintroduction to cellular automata As the applicability of cellular automata broadens and technology advances, there is a need for a concise, yet thorough, resource that lays the foundation of key cellularautomata rules and applications. In recent years, Stephen Wolfram's A New Kind of Science has brought the modeling power that lies in cellular automata to the attentionof the scientific world, and now, Cellular Automata: A Discrete View of the World presents all the depth, analysis, and applicability of the classic Wolfram text in a straightforward, introductory manner. This book offers an introduction to cellular automata as a constructive method for modeling complex systems where patterns of self-organization arising from simple rules are revealed in phenomena that exist across a wide array of subject areas, including mathematics, physics, economics, and the social sciences.The book begins with a preliminary introduction to cellular automata, including a brief history of the topic along with coverage of sub-topics such as randomness, dimension, information, entropy, and fractals. The author then provides a complete discussion of dynamical systems and chaos due to their close connection with cellular automata and includes chapters that focus exclusively on one- and two-dimensional cellular automata. The next and most fascinating area of discussion is the application of these types of cellular automata in order to understand the complex behavior that occurs in natural phenomena. Finally, the continually evolving topic of complexity is discussed with a focus on how to properly define, identify, and marvel at its manifestations in various environments.The author's focus on the most important principles of cellular automata, combined with his ability to present complex material in an easy-to-follow style, makes this book a very approachable and inclusive source for understanding the concepts and applications of cellular automata. The highly visual nature of the subject is accented with over 200 illustrations, including an eight-page color insert, which provide vivid representations of the cellular automata under discussion. Readers also have the opportunity to follow and understand the models depicted throughout the text and create their own cellular automata using Java applets and simple computer code, which are available via the book's FTP site. This book serves as a valuable resource for undergraduate and graduate students in the physical, biological, and social sciences and may also be of interest to any reader with a scientific or basic mathematical background.
Del 39 - Wiley Series in Discrete Mathematics and Optimization
Graph Coloring Problems
Häftad, Engelska, 1995
2 070 kr
Skickas inom 7-10 vardagar
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Del 44 - Wiley Series in Discrete Mathematics and Optimization
Interior Point Algorithms
Theory and Analysis
Inbunden, Engelska, 1997
2 450 kr
Skickas inom 7-10 vardagar
The first comprehensive review of the theory and practice of one oftoday's most powerful optimization techniques. The explosive growth of research into and development of interiorpoint algorithms over the past two decades has significantlyimproved the complexity of linear programming and yielded some oftoday's most sophisticated computing techniques. This book offers acomprehensive and thorough treatment of the theory, analysis, andimplementation of this powerful computational tool. Interior Point Algorithms provides detailed coverage of all basicand advanced aspects of the subject. Beginning with an overview offundamental mathematical procedures, Professor Yinyu Ye movesswiftly on to in-depth explorations of numerous computationalproblems and the algorithms that have been developed to solve them.An indispensable text/reference for students and researchers inapplied mathematics, computer science, operations research,management science, and engineering, Interior Point Algorithms:* Derives various complexity results for linear and convexprogramming* Emphasizes interior point geometry and potential theory* Covers state-of-the-art results for extension, implementation,and other cutting-edge computational techniques* Explores the hottest new research topics, including nonlinearprogramming and nonconvex optimization.
1 914 kr
Skickas inom 7-10 vardagar
A unified, modern treatment of the theory of random graphs-including recent results and techniquesSince its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include:* A focus on the fundamental theory as well as basic models of random graphs* A detailed description of the phase transition phenomenon* Easy-to-apply exponential inequalities for large deviation bounds* An extensive study of the problem of containing small subgraphs* Results by Bollobas and others on the chromatic number of random graphs* The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs* A gentle introduction to the zero-one laws* Ample exercises, figures, and bibliographic references
Del 48 - Wiley Series in Discrete Mathematics and Optimization
Introduction to the Theory of Error-Correcting Codes
Inbunden, Engelska, 1998
2 099 kr
Skickas inom 7-10 vardagar
A complete introduction to the many mathematical tools used to solve practical problems in coding. Mathematicians have been fascinated with the theory of error-correcting codes since the publication of Shannon's classic papers fifty years ago. With the proliferation of communications systems, computers, and digital audio devices that employ error-correcting codes, the theory has taken on practical importance in the solution of coding problems. This solution process requires the use of a wide variety of mathematical tools and an understanding of how to find mathematical techniques to solve applied problems. Introduction to the Theory of Error-Correcting Codes, Third Edition demonstrates this process and prepares students to cope with coding problems. Like its predecessor, which was awarded a three-star rating by the Mathematical Association of America, this updated and expanded edition gives readers a firm grasp of the timeless fundamentals of coding as well as the latest theoretical advances. This new edition features:* A greater emphasis on nonlinear binary codes* An exciting new discussion on the relationship between codes and combinatorial games* Updated and expanded sections on the Vashamov-Gilbert bound, van Lint-Wilson bound, BCH codes, and Reed-Muller codes* Expanded and updated problem sets. Introduction to the Theory of Error-Correcting Codes, Third Edition is the ideal textbook for senior-undergraduate and first-year graduate courses on error-correcting codes in mathematics, computer science, and electrical engineering.
Del 50 - Wiley Series in Discrete Mathematics and Optimization
Average Case Analysis of Algorithms on Sequences
Inbunden, Engelska, 2001
2 313 kr
Skickas inom 7-10 vardagar
A timely book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume.* Tools are illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching.* Includes chapters on algorithms and data structures on words, probabilistic and analytical models, inclusion-exclusion principles, first and second moment methods, subadditive ergodic theorem and large deviations, elements of information theory, generating functions, complex asymptotic methods, Mellin transform and its applications, and analytic poissonization and depoissonization.* Written by an established researcher with a strong international reputation in the field.
Del 51 - Wiley Series in Discrete Mathematics and Optimization
Maxima and Minima with Applications
Practical Optimization and Duality
Inbunden, Engelska, 1998
2 099 kr
Skickas inom 7-10 vardagar
This new work by Wilfred Kaplan, the distinguished author of influential mathematics and engineering texts, is destined to become a classic. Timely, concise, and content-driven, it provides an intermediate-level treatment of maxima, minima, and optimization. Assuming only a background in calculus and some linear algebra, Professor Kaplan presents topics in order of difficulty. In four short chapters, he describes basic concepts and geometric aspects of maxima and minima, progresses to problems with side conditions, introduces optimization and programming, and concludes with an in-depth discussion of research topics involving the duality theorems of Fenchel and Rockafellar. Throughout the text, the subject of convexity is gradually developed-from its theoretical underpinnings to problems, and finally, to its role in applications. Other features include:* A strong emphasis on practical applications of maxima and minima* An impressive array of supporting topics such as numerical analysis* An ample number of examples and problems* More than 60 illustrations highlighting the text* Algorithms to reinforce concepts* An appendix reviewing the prerequisite linear algebra Maxima and Minima with Applications is an ideal text for upper-undergraduate and graduate students taking courses in operations research, management, general engineering, and applied mathematics. It can also be used to supplement courses on linear and nonlinear optimization. This volume's broad scope makes it an excellent reference for professionals wishing to learn more about cutting-edge topics in optimization and mathematical programming.
2 012 kr
Skickas inom 7-10 vardagar
A mathematical gem–freshly cleaned and polished This book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course.Features retained from the first edition: Lively and engaging writing styleTimely and appropriate examplesNumerous well-chosen exercisesFlexible modular formatOptional sections and appendicesHighlights of Second Edition enhancements: Smoothed and polished exposition, with a sharpened focus on key ideasExpanded discussion of linear codesNew optional section on algorithmsGreatly expanded hints and answers sectionMany new exercises and examples
Del 53 - Wiley Series in Discrete Mathematics and Optimization
Introduction to Discrete Dynamical Systems and Chaos
Inbunden, Engelska, 1999
2 167 kr
Skickas inom 7-10 vardagar
A timely, accessible introduction to the mathematics of chaos. The past three decades have seen dramatic developments in the theory of dynamical systems, particularly regarding the exploration of chaotic behavior. Complex patterns of even simple processes arising in biology, chemistry, physics, engineering, economics, and a host of other disciplines have been investigated, explained, and utilized. Introduction to Discrete Dynamical Systems and Chaos makes these exciting and important ideas accessible to students and scientists by assuming, as a background, only the standard undergraduate training in calculus and linear algebra. Chaos is introduced at the outset and is then incorporated as an integral part of the theory of discrete dynamical systems in one or more dimensions. Both phase space and parameter space analysis are developed with ample exercises, more than 100 figures, and important practical examples such as the dynamics of atmospheric changes and neural networks. An appendix provides readers with clear guidelines on how to use Mathematica to explore discrete dynamical systems numerically. Selected programs can also be downloaded from a Wiley ftp site (address in preface). Another appendix lists possible projects that can be assigned for classroom investigation. Based on the author's 1993 book, but boasting at least 60% new, revised, and updated material, the present Introduction to Discrete Dynamical Systems and Chaos is a unique and extremely useful resource for all scientists interested in this active and intensely studied field.
Del 54 - Wiley Series in Discrete Mathematics and Optimization
Sorting
A Distribution Theory
Inbunden, Engelska, 2000
2 500 kr
Skickas inom 11-20 vardagar
A cutting-edge look at the emerging distributional theory of sorting Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting. Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory:* Contains introductory material on complete and partial sorting* Explains insertion sort, quick sort, and merge sort, among other methods* Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code* Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques* Features a variety of end-of-chapter exercises
Del 64 - Wiley Series in Discrete Mathematics and Optimization
Introduction to Stochastic Search and Optimization
Estimation, Simulation, and Control
Inbunden, Engelska, 2003
2 175 kr
Skickas inom 7-10 vardagar
* Unique in its survey of the range of topics.* Contains a strong, interdisciplinary format that will appeal to both students and researchers.* Features exercises and web links to software and data sets.
Del 55 - Wiley Series in Discrete Mathematics and Optimization
Integer and Combinatorial Optimization
Häftad, Engelska, 1999
1 983 kr
Skickas inom 7-10 vardagar
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
Del 2 - Wiley Series in Discrete Mathematics and Optimization
Logic-Based Methods for Optimization
Combining Optimization and Constraint Satisfaction
Inbunden, Engelska, 2000
2 343 kr
Skickas inom 7-10 vardagar
A pioneering look at the fundamental role of logic in optimization and constraint satisfactionWhile recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible modeling and solution techniques. Designed to be easily accessible to industry professionals and academics in both operations research and artificial intelligence, the book provides a wealth of examples as well as elegant techniques and modeling frameworks ready for implementation. Timely, original, and thought-provoking, Logic-Based Methods for Optimization:* Demonstrates the advantages of combining the techniques in problem solving* Offers tutorials in constraint satisfaction/constraint programming and logical inference* Clearly explains such concepts as relaxation, cutting planes, nonserial dynamic programming, and Bender's decomposition* Reviews the necessary technologies for software developers seeking to combine the two techniques* Features extensive references to important computational studies* And much more
2 099 kr
Skickas inom 7-10 vardagar
A lively invitation to the flavor, elegance, and power of graph theory This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory. Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to Pólya's enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra. The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.
2 722 kr
Skickas inom 7-10 vardagar
The theory of perfect graphs was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but has generated an important area of research in combinatorics. This book:* Includes an introduction by Claude Berge, the founder of perfect graph theory * Discusses the most recent developments in the field of perfect graph theory * Provides a thorough historical overview of the subject * Internationally respected authors highlight the new directions, seminal results and the links the field has with other subjects * Discusses how semi-definite programming evolved out of perfect graph theoryThe early developments of the theory are included to lay the groundwork for the later chapters. The most recent developments of perfect graph theory are discussed in detail, highlighting seminal results, new directions, and links to other areas of mathematics and their applications. These applications include frequency assignment for telecommunication systems, integer programming and optimisation.
3 092 kr
Skickas inom 7-10 vardagar
Praise for the First Edition "Anyone interested in getting an introduction to Ramsey theorywill find this illuminating..."--MAA Reviews Covering all the major concepts, proofs, and theorems, theSecond Edition of Ramsey Theory is the ultimate guideto understanding every aspect of Shelah's proof, as well asthe original proof of van der Waerden. The book offers a historicalperspective of Ramsey's fundamental paper from 1930 andErdos' and Szekeres' article from 1935, while placingthe various theorems in the context of T. S. Motzkin'sthought on the subject of "Complete Disorder isImpossible." Ramsey Theory, Second Edition includes new and excitingcoverage of Graph Ramsey Theory and Euclidean Ramsey Theory andalso relates Ramsey Theory to other areas in discrete mathematics.In addition, the book features the unprovability results of Parisand Harrington and the methods from topological dynamics pioneeredby Furstenburg. Featuring worked proofs and outside applications, RamseyTheory, Second Edition addresses:* Ramsey and density theorems on both broad and meticulousscales* Extentions and implications of van der Waerden's Theorem,the Hales-Jewett Theorem, Roth's Theorem, Rado'sTheorem, Szemeredi's Theorem, and the Shelah Proof* Regular homogeneous and nonhomogeneous systems andequations* Special cases and broader interdisciplinary applications ofRamsey Theory principles An invaluable reference for professional mathematicians workingin discrete mathematics, combinatorics, and algorithms, RamseyTheory, Second Edition is the definitive work on thesubject.
Del 26 - Wiley Series in Discrete Mathematics and Optimization
Contemporary Design Theory
A Collection of Surveys
Inbunden, Engelska, 1992
3 141 kr
Skickas inom 7-10 vardagar
Foremost experts in their field have contributed articles resulting in a compilation of useful and timely surveys in this ever-expanding field. Each of these 12 original papers covers important aspects of design theory including several in areas that have not previously been surveyed. Also contains surveys updating earlier ones where research is particularly active.
Del 33 - Wiley Series in Discrete Mathematics and Optimization
Combinatorial Optimization
Inbunden, Engelska, 1997
2 080 kr
Skickas inom 7-10 vardagar
A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade. Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:* Network flow problems* Optimal matching* Integrality of polyhedra* Matroids* NP-completeness Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.
Del 34 - Wiley Series in Discrete Mathematics and Optimization
Optimization Methods for Logical Inference
Inbunden, Engelska, 1999
2 002 kr
Skickas inom 7-10 vardagar
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though "solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs." Presenting powerful, proven optimization techniques for logic inference problems, Chandru and Hooker show how optimization models can be used not only to solve problems in artificial intelligence and mathematical programming, but also have tremendous application in complex systems in general. They survey most of the recent research from the past decade in logic/optimization interfaces, incorporate some of their own results, and emphasize the types of logic most receptive to optimization methods-propositional logic, first order predicate logic, probabilistic and related logics, logics that combine evidence such as Dempster-Shafer theory, rule systems with confidence factors, and constraint logic programming systems. Requiring no background in logic and clearly explaining all topics from the ground up, Optimization Methods for Logical Inference is an invaluable guide for scientists and students in diverse fields, including operations research, computer science, artificial intelligence, decision support systems, and engineering.
Del 36 - Wiley Series in Discrete Mathematics and Optimization
Network Models in Optimization and Their Applications in Practice
Inbunden, Engelska, 1992
2 625 kr
Skickas inom 7-10 vardagar
Unique in that it focuses on formulation and case studies ratherthan solutions procedures covering applications for pure,generalized and integer networks, equivalent formulations plussuccessful techniques of network models. Every chapter contains asimple model which is expanded to handle more complicateddevelopments, a synopsis of existing applications, one or more casestudies, at least 20 exercises and invaluable references. An Instructor's Manual presenting detailed solutions to all theproblems in the book is available upon request from the Wileyeditorial department.
Del 37 - Wiley Series in Discrete Mathematics and Optimization
Combinatorial Geometry
Inbunden, Engelska, 1995
2 167 kr
Skickas inom 7-10 vardagar
A complete, self-contained introduction to a powerful and resurging mathematical disciplineCombinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Tóth, Rogers, and Erd's. Nearly half the results presented in this book were discovered over the past twenty years, and most have never before appeared in any monograph. Combinatorial Geometry will be of particular interest to mathematicians, computer scientists, physicists, and materials scientists interested in computational geometry, robotics, scene analysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutions that help students clarify their understanding and test their mastery of the material. Topics covered include: Geometric number theoryPacking and covering with congruent convex disksExtremal graph and hypergraph theoryDistribution of distances among finitely many pointsEpsilon-nets and Vapnik—Chervonenkis dimensionGeometric graph theoryGeometric discrepancy theoryAnd much more
Del 23 - Wiley Series in Discrete Mathematics and Optimization
Discrete Location Theory
Inbunden, Engelska, 1990
3 400 kr
Skickas inom 7-10 vardagar
This invaluable resource presents the state of the art in discrete location theory. Among the topics covered are: locations with spatial interactions such as the quadratic assignment problem and competitive locations and games; duality and decomposition methods for facility location problems; the uncapacitated facility location problem; the p-median problem; location of mobile units in a stochastic environment; covering problems; and the p-center problem. Leading experts in the field of discrete location theory contributed to each chapter. In addition, there are numerous exercises, references, notes and further discussions which serve as aids for understanding theoretical and algorithmic concepts.
Del 12 - Wiley Series in Discrete Mathematics & Optimization
Traveling Salesman Problem
A Guided Tour of Combinatorial Optimization
Inbunden, Engelska, 1985
5 135 kr
Skickas inom 7-10 vardagar
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
Del 21 - Wiley Series in Discrete Mathematics & Optimization
Simulated Annealing and Boltzmann Machines
A Stochastic Approach to Combinatorial Optimization and Neural Computing
Inbunden, Engelska, 1988
4 374 kr
Skickas inom 7-10 vardagar
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 applicability of its evolving techniques point to the rapidity with which the field is moving from its beginnings to maturity and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley - Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of this extraordinary development. Recent titles in the Series: Search Problems Rudolf Ahlswede, University of Bielefeld, Federal Republic of Germany Ingo Wegener, Johann Wolfgang Goethe University, Frankfurt, Federal Republic of Germany The problems of search, exploration, discovery and identification are of key importance in a wide variety of applications. This book will be of great interest to all those concerned with searching, sorting, information processing, design of experiments and optimal allocation of resources. 1987 Introduction to Optimization E. M. L. Beale FRS, Scicon Ltd, Milton Keynes, and Imperial College, London This book is intended as an introduction to the many topics covered by the term 'optimization', with special emphasis on applications in industry. It is divided into three parts. The first part covers unconstrained optimization, the second describes the methods used to solve linear programming problems, and the third covers nonlinear programming, integer programming and dynamic programming. The book is intended for senior undergraduate and graduate students studying optimization as part of a course in mathematics, computer science or engineering. 1988
1 127 kr
Skickas inom 7-10 vardagar
Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems, algorithms, and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra, linear inequalities, and linear programming; 8 The structure of polyhedra; 9 Polarity, and blocking and anti-blocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primal-dual, elimination, and relaxation methods; 13 Khachiyan's method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index
1 432 kr
Skickas inom 7-10 vardagar
Praise for the First Edition"... complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity."—Zentralblatt MATHA thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer scienceAdditional exercises at varying levels of difficulty to further test comprehension of the presented materialEnd-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.
Del 78 - Wiley Series in Discrete Mathematics and Optimization
Introduction to Combinatorics
Inbunden, Engelska, 2013
1 408 kr
Skickas inom 5-8 vardagar
Praise for the First Edition “This excellent text should prove a useful accoutrement for any developing mathematics program . . . it’s short, it’s sweet, it’s beautifully written.” —The Mathematical Intelligencer“Erickson has prepared an exemplary work . . . strongly recommended for inclusion in undergraduate-level library collections.” —ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin’s sequence, Rook paths, and Leech’s lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations.Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden’s theorem on arithmetic progressions, Pólya’s graph enumeration formula, and Leech’s 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideasA deeper, investigative study of combinatorics through exercises requiring the use of computer programsOver fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial conceptsBasic principles and theories in combinatorics as well as new and innovative results in the fieldIntroduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics.
960 kr
Skickas inom 7-10 vardagar
Praise for the First Edition "Anyone interested in getting an introduction to Ramsey theorywill find this illuminating..."--MAA Reviews Covering all the major concepts, proofs, and theorems, theSecond Edition of Ramsey Theory is the ultimate guideto understanding every aspect of Shelah's proof, as well asthe original proof of van der Waerden. The book offers a historicalperspective of Ramsey's fundamental paper from 1930 andErdos' and Szekeres' article from 1935, while placingthe various theorems in the context of T. S. Motzkin'sthought on the subject of "Complete Disorder isImpossible." Ramsey Theory, Second Edition includes new and excitingcoverage of Graph Ramsey Theory and Euclidean Ramsey Theory andalso relates Ramsey Theory to other areas in discrete mathematics.In addition, the book features the unprovability results of Parisand Harrington and the methods from topological dynamics pioneeredby Furstenburg. Featuring worked proofs and outside applications, RamseyTheory, Second Edition addresses:* Ramsey and density theorems on both broad and meticulousscales* Extentions and implications of van der Waerden's Theorem,the Hales-Jewett Theorem, Roth's Theorem, Rado'sTheorem, Szemeredi's Theorem, and the Shelah Proof* Regular homogeneous and nonhomogeneous systems andequations* Special cases and broader interdisciplinary applications ofRamsey Theory principles An invaluable reference for professional mathematicians workingin discrete mathematics, combinatorics, and algorithms, RamseyTheory, Second Edition is the definitive work on thesubject.
1 255 kr
Skickas inom 7-10 vardagar
Praise for the Third Edition“Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book.” - MAA ReviewsMaintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics.Emphasizing the methodology and techniques that enable problem-solving, The Probabilistic Method, Fourth Edition begins with a description of tools applied to probabilistic arguments, including basic techniques that use expectation and variance as well as the more advanced applications of martingales and correlation inequalities. The authors explore where probabilistic techniques have been applied successfully and also examine topical coverage such as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Written by two well-known authorities in the field, the Fourth Edition features: Additional exercises throughout with hints and solutions to select problems in an appendix to help readers obtain a deeper understanding of the best methods and techniquesNew coverage on topics such as the Local Lemma, Six Standard Deviations result in Discrepancy Theory, Property B, and graph limitsUpdated sections to reflect major developments on the newest topics, discussions of the hypergraph container method, and many new references and improved resultsThe Probabilistic Method, Fourth Edition is an ideal textbook for upper-undergraduate and graduate-level students majoring in mathematics, computer science, operations research, and statistics. The Fourth Edition is also an excellent reference for researchers and combinatorists who use probabilistic methods, discrete mathematics, and number theory.Noga Alon, PhD, is Baumritter Professor of Mathematics and Computer Science at Tel Aviv University. He is a member of the Israel National Academy of Sciences and Academia Europaea. A coeditor of the journal Random Structures and Algorithms, Dr. Alon is the recipient of the Polya Prize, The Gödel Prize, The Israel Prize, and the EMET Prize.Joel H. Spencer, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is a Sloane Foundation Fellow. Dr. Spencer has written more than 200 published articles and is the coauthor of Ramsey Theory, Second Edition, also published by Wiley.