A heuristic for blocking flow algorithms

Article Abstract:

A heuristic for reducing the solution time of blocking flow algorithms for maximum flow problems is presented. The heuristic, which is applicable to algorithms that repeatedly determine blocking flows in acyclic networks, assigns a capacity to vertices of an acyclic network to set an upper bound on the flow between vertices and the sink. Its static version calculates capacities only once while a dynamic version continually modifies capacities during the computation of the blocking flow.

Combinatorial optimization, Network analyzers

---

Competitive capacity expansion under demand uncertainty

Article Abstract:

The capacity expansion strategies of firms facing uncertain market demand were examined using a two-period duopoly model. Specifically, the unique symmetric Nash equilibrium was derived for two scenarios, namely, when firms determine their capacities concurrently with their investment decisions and when firms do so sequentially. The results showed that it is better for firms to move simultaneously and preempt their competition despite the risk of overcapacity.

Strategic planning (Business), Duopolies, Industrial capacity

---

Similar abstracts:

• Abstracts: Planning and performance in state-owned enterprises: a multidimensional assessment. Planning of high school examinations in Denmark
• Abstracts: Decision analysis interviews in environmental impact assessment. Towards an optimal model of food nutrition structure related to production development for the region of the middle-lower reach of the Yangtze in China

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.