Many problems in the supply chain management can be formulated as a network flow problem with specified arc cost functions. Let G(N, A) represent a network where N and A are the sets of nodes and arcs, respectively, and fa(xa) denotes an arc cost function. In the network, there are supply and demand nodes, and the main objective of the problem is to minimize the total cost by satisfying the dem...

Upcoming heterogeneous systems ask for new programming paradigms. Abstracting the underlying hardware architecture is desirable in order to support productive software development. This thesis proposes a design flow and runtime-system for executing process networks on heterogeneous systems using OpenCL. Process networks are a popular model of computation for deterministic parallel programming a...

We improve the mixed-integer programming formulation of the multicommodity capacitated fixed-charge network design problem by incorporating valid inequalities into a cutting-plane algorithm. We use five classes of valid inequalities: the strong, cover, minimum cardinality, flow cover, and flow pack inequalities, the last four being expressed in terms of cutsets of the network. We develop effici...

Abstract Understanding the metabolism mechanisms in living organisms is a major task for postgenomic biology. Cellular metabolism is usually represented by a complex network of reactants connected by chemical reactions catalyzed by enzymes. In this paper, a mass flow conservation model is proposed to describe the process of cellular metabolism, which can be formulated as a linear programming mo...

The problem of finding optimal routes in a packetswitched computer network can be formulated as a nonlinear multicommodity flow problem. The application of traditional mathematical programming techniques to the solution of the routing problem for reasonably large networks is computationally inefficient. Satisfactory results have been recently obtained with various heuristic techniques; however,...

In this work we deal with the perimeter flow control problem of bi-modal urban networks by use of a three-dimensional Macroscopic Fundamental Diagram (3D-MFD). The 3D-MFD relates the accumulation of cars and buses and the outflow (or circulating flow) in a bi-modal traffic network. We assume that the impact of each mode on the traffic flow in the network is different, i.e. each bus can not be c...

A general algorithm is presented for determining values for unit cost coefficients that reflect water use priorities for network flow programming models of water resource systems. The overarching principle for setting unit penalties for priority-based operations is that senior unit penalties must exceed the combined junior unit penalties for any feasible competing space-time path through the sy...

Machine Learning (ML) has gained prominence and tremendous applications in fields like medicine, biology, geography astrophysics, to name a few. Arguably, such areas, it is used by domain experts, who are not necessarily skilled-programmers. Thus, presents steep learning curve for experts programming ML applications. To overcome this foster widespread adoption of techniques, we propose equip th...