This book provides a thorough and up-to-date discussion of arc routing by world-renowned researchers. Organized by problem type, the book offers a rigorous treatment of complexity issues, models, algorithms, and applications. Arc Routing: Problems, Methods, and Applications opens with a historical perspective of the field and is followed by three sections that cover complexity and the Chinese Postman and the Rural Postman problems; the Capacitated Arc Routing Problem and routing problems with min-max and profit maximization objectives; and important applications, including meter reading, snow removal, and waste collection.

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.

In recent years, many new techniques have emerged in the mathematical theory of discrete optimization that have proven to be effective in solving a number of hard problems. This book presents these recent advances, particularly those that arise from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside of the standard curriculum in optimization. These new techniques, all of which are presented with minimal prerequisites, provide a transition from linear to nonlinear discrete optimization. This book can be used as a textbook for advanced undergraduates or first-year graduate students in mathematics, computer science or operations research. It is also appropriate for mathematicians, engineers, and scientists engaged in computation who wish to gain a deeper understanding of how and why algorithms work.

This well-written book contains the analytical tools, concepts, and viewpoints needed for modern applied mathematics. It treats various practical methods for solving problems such as differential equations, boundary value problems, and integral equations. Pragmatic approaches to difficult equations are presented, including the Galerkin method, the method of iteration, Newton’s method, projection techniques, and homotopy methods.

This course in real analysis begins with the usual measure theory, then brings the reader quickly to a level where a wider than usual range of topics can be appreciated. Topics covered include Lp- spaces, rearrangement inequalities, sharp integral inequalities, distribution theory, Fourier analysis, potential theory, and Sobolev spaces. To illustrate these topics, there is a chapter on the calculus of variations, with examples from mathematical physics, as well as a chapter on eigenvalue problems (new to this edition). For graduate students of mathematics, and for students of the natural sciences and engineering who want to learn tools of real analysis. Assumes a previous course in calculus. Lieb is affiliated with Princeton University. Loss is affiliated with Georgia Institute of Technology. c. Book News Inc.

This comprehensive book is presented in two parts; the first part introduces the basics of matrix analysis necessary for matrix computations, and the second part presents representative methods and the corresponding theories in matrix computations. Among the key features of the book are the extensive exercises at the end of each chapter. Matrix Analysis and Computations provides readers with the matrix theory necessary for matrix computations, especially for direct and iterative methods for solving systems of linear equations. It includes systematic methods and rigorous theory on matrix splitting iteration methods and Krylov subspace iteration methods, as well as current results on preconditioning and iterative methods for solving standard and generalized saddle-point linear systems. This book can be used as a textbook for graduate students as well as a self-study tool and reference for researchers and engineers interested in matrix analysis and matrix computations. It is appropriate for courses in numerical analysis, numerical optimization, data science, and approximation theory, among other topics

Our understanding of the fundamental processes of the natural world is based to a large extent on partial differential equations (PDEs). The second edition of Partial Differential Equations provides an introduction to the basic properties of PDEs and the ideas and techniques that have proven useful in analyzing them. It provides the student a broad perspective on the subject, illustrates the incredibly rich variety of phenomena encompassed by it, and imparts a working knowledge of the most important techniques of analysis of the solutions of the equations. In this book mathematical jargon is minimized. Our focus is on the three most classical PDEs: the wave, heat and Laplace equations. Advanced concepts are introduced frequently but with the least possible technicalities. The book is flexibly designed for juniors, seniors or beginning graduate students in science, engineering or mathematics.

This superb and self-contained work is an introductory presentation of basic ideas, structures, and results of differential and integral calculus for functions of several variables. The wide range of topics covered include the differential calculus of several variables, including differential calculus of Banach spaces, the relevant results of Lebesgue integration theory, and systems and stability of ordinary differential equations. An appendix highlights important mathematicians and other scientists whose contributions have made a great impact on the development of theories in analysis. This text motivates the study of the analysis of several variables with examples, observations, exercises, and illustrations. It may be used in the classroom setting or for self-study by advanced undergraduate and graduate students and as a valuable reference for researchers in mathematics, physics, and engineering.

Nothing provided

This book provides the essential foundations of both linear and nonlinear analysis necessary for understanding and working in twenty-first century applied and computational mathematics. In addition to the standard topics, this text includes several key concepts of modern applied mathematical analysis that should be, but are not typically, included in advanced undergraduate and beginning graduate mathematics curricula. This material is the introductory foundation upon which algorithm analysis, optimization, probability, statistics, differential equations, machine learning, and control theory are built. When used in concert with the free supplemental lab materials, this text teaches students both the theory and the computational practice of modern mathematical analysis. Foundations of Applied Mathematics, Volume 1: Mathematical Analysis includes several key topics not usually treated in courses at this level, such as uniform contraction mappings, the continuous linear extension theorem, Daniell?Lebesgue integration, resolvents, spectral resolution theory, and pseudospectra. Ideas are developed in a mathematically rigorous way and students are provided with powerful tools and beautiful ideas that yield a number of nice proofs, all of which contribute to a deep understanding of advanced analysis and linear algebra. Carefully thought out exercises and examples are built on each other to reinforce and retain concepts and ideas and to achieve greater depth. Associated lab materials are available that expose students to applications and numerical computation and reinforce the theoretical ideas taught in the text. The text and labs combine to make students technically proficient and to answer the age-old question, "When am I going to use this?