This paper integrates competitive pricing and network design problems for the short life cycle products. The pricing problem determines selling prices of the products for different life cycle phases in a competitive market, as well as acquisition management of returned products. Besides, the selling and acquisition prices are related to the distance between distribution centers and customers. T...

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

Awareness of the level of river flow and its fluctuations at different times is one of the significant factor to achieve sustainable development for water resource issues. Therefore, the present study two hybrid models, Wavelet- Adaptive Neural Fuzzy Interference System (WANFIS) and Wavelet- Artificial Neural Network (WANN) are used for flow prediction of Gamasyab River (Nahavand, Hamedan, Iran...

This paper is concerned with the minimum-cost flow problem over an arbitrary flow network. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non...

The effect of network coding began widely realized when a network with its optimized throughput can be achieved only if linear coding was introduced to its intermediate nodes was presented by R.Ahlswede et al. in [1]. A series of advantages of network coding over routing have been discovered during afterwards research by R.Koetter, M.Médard et al. This talk tries to provide an overview of netwo...

The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...

Utilizing capacitor banks is very conventional in distribution network in order for local compensation of reactive power. This will be more important considering uncertainties including wind generation and loads uncertainty. Harmonics and non-linear loads are other challenges in power system which complicates the capacitor placement problem. Thus, uncertainty and network harmonics have been con...

The Pareto Optimal set for the multicriteria network flow problem is described by the theorem for ParetoOptimal flow augmenting paths. An approach for determining of the unsupported integer PO solutions of the investigated problem is proposed.

Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more edges from the network.