Using the fact that connections between vertices of a network often represent directed and weighted flows, we apply hydraulic principles to develop novel insights into network structure and growth. We develop a network model based on Bernoulli's principle and use it to analyze changes in network...

A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...

The problem of group ranking, also known as rank aggregation, has been studied in contexts varying from sports, to multicriteria decision making, to machine learning, to ranking Web pages, and to behavioral issues. The dynamics of the group aggregation of individual decisions has been a subject...

This note addresses a problem of assigning human operators to operations in a manufacturing system. The problem involves a set of operations, a work load for each operation, and a set of human operators, each skilled at a subset of the operations. The task is to assign the operators to the...

A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which may be positive or negative, the maximal closure problem is one of finding a closure with the largest possible sum of node weights. It can be solved by any...

We consider a capital budgeting problem in which each potential project requires the performance of a known set of activities. In general, these sets of activities are not mutually exclusive. However, when a particular activity is common to the requirements of multiple projects, a single...

A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...

The goal of this research is to develop a comprehensive model that describes the integrated logistics operations in response to natural disasters. We propose a mathematical model that controls the flow of several relief commodities from the sources through the supply chain and until they are...

We consider the problem of scheduling n jobs, each with a specific processing requirement, release time and due date on m uniform parallel machines. It is shown that a feasible schedule can be obtained by determining the maximum flow in a network, thus permitting the use of standard network flow...

Based on data from geographical information system (GIS) and daily commuting origin destination (OD) matrices, we estimated the distribution of traffic flow in the San Francisco road network and studied Braess’s paradox in a large-scale transportation network with realistic travel demand. We...