This first book focuses on uncertain graph and network optimization. It covers three different main contents: uncertain graph, uncertain programming and uncertain network optimization. It also presents applications of uncertain network optimization in a lot of real problems such as transportation problems, dispatching medical supplies problems and location problems. The book is suitable for researchers, engineers, teachers and students in the field of mathematics, information science, computer science, decision science, management science and engineering, artificial intelligence, industrial engineering, economics and operations research.

Large-scale, highly interconnected networks, which are often modeled as graphs, pervade both our society and the natural world around us. Uncertainty, on the other hand, is inherent in the underlying data due to a variety of reasons, such as noisy measurements, lack of precise information needs, inference and prediction models, or explicit manipulation, e.g., for privacy purposes. Therefore, uncertain, or probabilistic, graphs are increasingly used to represent noisy linked data in many emerging application scenarios, and they have recently become a hot topic in the database and data mining communities. Many classical algorithms such as reachability and shortest path queries become #P-complete and, thus, more expensive over uncertain graphs. Moreover, various complex queries and analytics are also emerging over uncertain networks, such as pattern matching, information diffusion, and influence maximization queries. In this book, we discuss the sources of uncertain graphs and their applications, uncertainty modeling, as well as the complexities and algorithmic advances on uncertain graphs processing in the context of both classical and emerging graph queries and analytics. We emphasize the current challenges and highlight some future research directions.

Many decision problems in Operations Research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to model projects, computer applications, digital circuits and production processes. Optimization problems arise in temporal networks when a decision maker wishes to determine a temporal arrangement of the tasks and/or a resource assignment that optimizes some network characteristic (e.g. the time required to complete all tasks). The parameters of these optimization problems (e.g. the task durations) are typically unknown at the time the decision problem arises. This monograph investigates solution techniques for optimization problems in temporal networks that explicitly account for this parameter uncertainty. We study several formulations, each of which requires different information about the uncertain problem parameters.

Problems in network optimization arise in all areas of technology and industrial management. The topic of network flows has applications in diverse fields such as chemistry, engineering, management science, scheduling and transportation, to name a few. Network Optimization introduces the subject to undergraduate and graduate students in computer science, mathematics and operations research. The focus is mainly on developing the mathematical underpinnings of the techniques that make it possible to solve the several optimization problems covered in the text. The text discusses such topics as optimal branching problems, transshipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs and many applications to combinatorics. Also included is a large number of exercises.

In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems./a

An up-to-date, authoritative, comprehensive look at optimization theory in uncertain environments Real-life management decisions, such as buy/sell decisions in the stock market, are almost always made in uncertain environments. Is it possible to make model decision problems to fit these circumstances? Once constructed, can these models be solved? In Uncertain Programming, Baoding Liu answers both of these questions in the affirmative and goes on to lay a solid foundation for optimization in generally uncertain environments. Uncertain Programming describes the basic concepts of mathematical programming, provides a genetic algorithm for optimization problems, and introduces the techniques of stochastic and fuzzy simulation. After examining some basic results of expected value models, the book moves on to explore chance-constrained programming with stochastic parameters and illustrate applications of chance-constrained programming models. Dr. Liu discusses dependent-chance programming in stochastic environments and extends both chance-constrained and dependent-chance programming from stochastic to fuzzy environments. He then constructs a theoretical framework for fuzzy programming with fuzzy rather than crisp decisions. This remarkable and revolutionary book: * Lays a foundation for optimization theory in uncertain environments * Provides a unifying principle for dealing with stochastic and fuzzy programming * Incorporates the most recent developments in the field * Emphasizes modeling ideas, evolutionary computation, and applications of uncertain programming Uncertain Programming is a reliable, authoritative, and eye-opening guide for researchers and engineers in operations research, management science, business management, information and systems science, and computer science.

With the increasing of the complexity of a system, there is a variety of indeterminacy in the practical applications of graph theory. We focus on uncertain random graph, in which some edges exist with degrees in probability measure and others exist with degrees in uncertain measure. In this paper, the chance theory is applied to construct the cycle index of an uncertain random graph. Then a method to calculate the cycle index of an uncertain random graph is presented. We also discuss some properties of the cycle index.