Author: Panos M. Pardalos
Publisher: Springer Science & Business Media
ISBN: 3642591795
Category : Business & Economics
Languages : en
Pages : 495
Get Book Here
Book Description
Network optimization is important in the modeling of problems and processes from such fields as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Recent advances in data structures, computer technology, and algorithm development have made it possible to solve classes of network optimization problems that until recently were intractable. The refereed papers in this volume reflect the interdisciplinary efforts of a large group of scientists from academia and industry to model and solve complicated large-scale network optimization problems.
Author:
Publisher:
ISBN:
Category : Dissertations, Academic
Languages : en
Pages : 1006
Get Book Here
Book Description
Author: Nabil H. Mustafa
Publisher: American Mathematical Society
ISBN: 1470461560
Category : Mathematics
Languages : en
Pages : 251
Get Book Here
Book Description
Understanding the behavior of basic sampling techniques and intrinsic geometric attributes of data is an invaluable skill that is in high demand for both graduate students and researchers in mathematics, machine learning, and theoretical computer science. The last ten years have seen significant progress in this area, with many open problems having been resolved during this time. These include optimal lower bounds for epsilon-nets for many geometric set systems, the use of shallow-cell complexity to unify proofs, simpler and more efficient algorithms, and the use of epsilon-approximations for construction of coresets, to name a few. This book presents a thorough treatment of these probabilistic, combinatorial, and geometric methods, as well as their combinatorial and algorithmic applications. It also revisits classical results, but with new and more elegant proofs. While mathematical maturity will certainly help in appreciating the ideas presented here, only a basic familiarity with discrete mathematics, probability, and combinatorics is required to understand the material.
Author: Dimitri P. Bertsekas
Publisher: MIT Press
ISBN: 9780262023344
Category : Business & Economics
Languages : en
Pages : 384
Get Book Here
Book Description
Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems.
Author: Michael Drmota
Publisher: Springer Science & Business Media
ISBN: 3211753575
Category : Mathematics
Languages : en
Pages : 466
Get Book Here
Book Description
The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.
Author: Bruno Simeone
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 454
Get Book Here
Book Description
Author: Philippe Flajolet
Publisher: Cambridge University Press
ISBN: 1139477161
Category : Mathematics
Languages : en
Pages : 825
Get Book Here
Book Description
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.
Author: Jeff L. Kennington
Publisher: John Wiley & Sons
ISBN:
Category : Computers
Languages : en
Pages : 320
Get Book Here
Book Description
Linear programming; the simplex method for network program; the out-of-kilter algorithm for the network program; the simplex method for the generalized network problem; the multicommodity network flow problem; the simplex method for the network with side constraints model; appendixes: characterization of a tree; data structures for network programs; convergence of subgradient optimization algorithm; projection operation for subgradient algorithm; a product form representation of the inverse of a multicommodity cycle matrix; NETFLO; references; index.
