This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a region of R is one example. It is found that the average distance traveled by an item in the TLP increases with N; i.e., the unit cost is unbounded when N and the length of the region are increased in a fixed ratio. Fur...

Commodity storage-assets can be either physical storage-facilities, or contracts guaranteeing their use. Merchants employ them to support their commodity-trading activities in wholesale markets, which are characterized by notoriously volatile prices. Managing a storage asset requires determining an inventory-management policy, which, given a realization of the commodity price, consists of choos...

This note addresses the undirected multiflow (multicommodity flow) theory. A multiflow in a network with terminal set T can be regarded as a single commodity (A, T \A)-flow for any nonempty proper subset A ⊂ T by ignoring flows not connecting A and T \ A. A set system A on T is said to be lockable if for every network having T as terminal set there exists a multiflow being simultaneously a maxi...

The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it is called static if the routing must be the sa...

Throughput is a main performance objective in communication networks. This paper considers fundamental maximum throughput routing problem-the all-or-nothing multicommodity flow (ANF) problem - arbitrary directed graphs and the practically relevant but challenging setting where demands can be (much) larger than edge capacities. Hence, addition to assigning requests valid flows for each routed co...

The Internet has seen a proliferation of specialized middlebox devices that carry out crucial network functionality such as load balancing, packet inspection or intrusion detection, amongst others. Traditionally, high performance network devices have been built on custom multi-core, specialized memory hierarchies, architectures which are well suited to packet processing. Recently, commodity PC ...

An airline crew rostering problem is a large-scaled and complex optimization problem that assigns crew members to the flight duties while satisfying agreements with the labor union, the government regulations, the carrier’s own policies, and other requirements. The traditional crew rostering problem considers only minimizing the total perdiem in order to reduce the airline expense. This paper p...

The pooling problem is a nonconvex nonlinear programming problem with numerous applications. The nonlinearities of the problem arise from bilinear constraints that capture the blending of raw materials. Bilinear constraints are well-studied and significant progress has been made in solving large instances of the pooling problem to global optimality. This is due in no small part to reformulation...

We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partition into two sets of customer nodes and one set of Steiner nodes. We ask for the minimum weight connected subgraph containing all customer nodes, in which the nodes of the second customer set are nodewise 2-connected. This probl...

0 Two problems relevant to the design of a store-and-forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non-linear, uncomtAcUmd multicommodity (m.c.) flow problems. A "Flow Deviation" (FD) method for the solution of these non-linear, unconstrained m.c. flow problems is described which is qui...