Several enumeration and reliability problems are shown to be # P-complete, hence, at least as hard NP-complete problems. Included important in network analysis, namely, computing the probability that a graph is connected counting number of minimum cardinality $(s,t)$-cuts or directed cuts. Also P-complete vertex covers bipartite graph, antichains partial order, approximating pair vertices connected.

A least-mean-square (LMS) adaptive algorithm for complex signals is derived. The original Widrow-Hoff LMS W <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j+l</inf> = xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> + 2µεjX . form shown to be xmlns:xlink="http://www.w3.org/1999/xlink">j+1</inf> <sup xmlns:xlink="http://www.w3.org/1999/xlink">-</sup> , where the boldfaced terms represent (phasor) and bar above X designates conjugate.

This paper presents an overview of results related to the computational complexity network reliability analysis problems. Network problems deal with determination measures for stochastic networks. We show how these are more familiar recognizing certain subnetworks, finding optimal and counting subnetworks. use relationships that k-terminal, 2-terminal, all-terminal at least as hard renowned set computationally difficult problems, NP-Complete. Finally, we discuss impact on one should approach...

This article proposes a reliability model for emergency service vehicle location. Emergency services planners must solve the strategic problem of where to locate stations and tactical number vehicles place in each station. We view from system perspective, failure is interpreted as inability respond demand call within an acceptable amount time. Our handles stochastic aspects more explicit way than previous models literature. Based on bound probability failure, we derive 0-1 integer...

Manufacturability of printed circuit boards is a fertile area for operations researchers to aid in productivity improvements the electronics industry. A class such problems described, and particular problem that arises from an application middle sized firm modeled solved. The specific determine best sequence insertion formulated as type directed postman problem. An algorithm developed yields optimal solution under certain conditions approximate solutions, with constant performance bound,...

Abstract This paper considers the difficulty of computing several measures network reliability on directed and undirected networks. Results concerning NP‐difficulty analysis problems are unified in cases generalized to wider classes measures. Reductions also given that relate networks with without node failures.

The inventory-routing problem is a distribution in which each customer maintains local inventory of product such as heating oil and consumes certain amount that day. Given central supplier, the objective to minimize annual delivery costs while attempting insure no runs out commodity at any time. In this article we present procedure for reducing long-term version single-period problem, can be attacked using standard routing algorithms. reduction involves definition reflect costs, safety stock...

AbstractIn this article we develop a model for estimating flight departure delay distributions required by air traffic congestion prediction models. We identify and study major factors that influence delays, strategic model. This employs nonparametric methods daily seasonal trends. In addition, the uses mixture distribution to estimate residual errors. To overcome problems with local optima in distribution, global optimization version of expectation–maximization algorithm, borrowing ideas...

This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The considered are the probability that s t communicate for all node pairs t, operative communicate, expected number of communicating. It also computes latter two when communication must proceed through root node. A specialized version is given networks only

In this paper, we consider the revenue management problem from perspective of online algorithms. This approach eliminates need for both demand forecasts and a risk-neutrality assumption. The competitive ratio policy relative to given input sequence is policy's performance offline optimal. Under algorithm approach, policies are evaluated based on highest they can guarantee. We able define lower bounds best-possible describe that achieve these bounds. address two-fare in greatest detail, but...

In this paper, we analyze a generalization of classic network-flow model. The involves the replacement deterministic demand with stochastic demand. While destroys original network structure, show that matrix underlying model is dual network. Thus, integer program associated can be solved efficiently using or linear-programming techniques. We also develop an application to ground-holding problem in air-traffic management. use for improves upon prior models by allowing easy integration into...

Abstract In this article, computational procedures are presented for generating bounds on measures of network reliability. The two considered, reachability and connectedness, the probability that there is an operating path from a node to all other nodes in directed (respectively undirected) stochastic network. Our bounds, which given terms polynomials p , common arc failure probability, based recent bounding results developed by authors class shellable independence systems. Two pairs given:...

This paper considers a class of network optimization problems in which certain directed arcs must be covered by set cycles. Our study was motivated distribution planning problem commercial firm that had to make deliveries over several origin‐destination pairs (directed arcs) and could service any demand arc using vehicle its own fleet or paying common carrier. The is determine an optimal size the resulting routes while satisfying maximum route‐time restrictions. We formulate problem,...

We present a new algorithm that computes the probability there is an operating path from node s to t in stochastic network. The computation time of this bounded by polynomial number (s, t)-cuts also examine complexity other connectedness reliability problems with respect cutsets and pathsets These are distinguished as either having algorithms such sets, or no unless P = NP.

Abstract The Federal Aviation Administration (FAA) and the airline community within United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between FAA airlines, so as to increase control over decisions that involve economic tradeoffs. So far, has primarily led enhancements in implementation Ground Delay Programs, by changing procedures allocating slots airlines...

In this paper, we describe a computerized procedure for scheduling mass transit crews and vehicles. The differs from previous methods in that rather than first vehicles then crews, it schedules simultaneously. Several of the subproblems are solved as matching problems on graphs. A computational test using database Baltimore Metropolitan Transit Authority has produced solutions lower cost those used by authority.

The available‐to‐promise (atp) function is becoming increasingly important in supply chain management since it directly links production resources with customer orders. In this paper, a mixed integer programming (mip) ATP model presented. This can provide an order‐promising and ‐fulfillment solution for batch of orders that arrive within predefined batching interval. A variety constraints, such as raw material availability, capacity, compatibility, preferences, are considered. Simulation...