Search Results - subject:"cost flow"

Using integer programming for balancing return and risk in problems with individual chance constraints

Shen, Siqian - In: Computers & operations research : and their … 49 (2014), pp. 59-70

Persistent link: https://www.econbiz.de/10010383156

Note on “Inverse minimum cost flow problems under the weighted Hamming distance”

Tayyebi, Javad; Aman, Massoud - In: European Journal of Operational Research 234 (2014) 3, pp. 916-920

Jiang et al. proposed an algorithm to solve the inverse minimum cost flow problems under the bottleneck-type weighted … Hamming distance [Y. Jiang, L. Liu, B. Wuc, E. Yao, Inverse minimum cost flow problems under the weighted Hamming distance …

Persistent link: https://www.econbiz.de/10011052653

Surface displacement estimation along Himalayan frontal fault using differential SAR interferometry

Bhattacharya, Atanu; Sharma, Mukat; Arora, Manoj - In: Natural Hazards 64 (2012) 2, pp. 1105-1123

The Himalayan region has been studied extensively during the past few decades in terms of present ongoing deformations. Various models have been proposed for the evolution of the Himalaya to explain the cause of earthquake occurrences and to understand the seismotectonics of the Himalayan...

Persistent link: https://www.econbiz.de/10010995704

Vector network equilibrium problems with capacity constraints of arcs

Xu, Y.D.; Li, S.J.; Teo, K.L. - In: Transportation Research Part E: Logistics and … 48 (2012) 3, pp. 567-577

different paths. We obtain some necessary and sufficient conditions for a (weak) vector minimum cost flow. By virtue of a (weak …

Persistent link: https://www.econbiz.de/10011048983

Regression modelling of risk impacts on construction cost flow forecast

Odeyinka, Henry; Lowe, John; Kaka, Ammar - In: Journal of Financial Management of Property and Construction 17 (2012) 3, pp. 203-221

Purpose – Significant risk factors inherent in construction cost flow forecast were identified in this study. The aim … in cost flow forecast. The second stage was the collection of forecast and actual cost flow data from 55 case study … also provided some insights in explaining the observed variability between the baseline cost flow forecast and actual cost …

Persistent link: https://www.econbiz.de/10014868923

A less-than-truckload carrier collaboration planning problem under dynamic capacities

Hernández, Salvador; Peeta, Srinivas; Kalafatas, George - In: Transportation Research Part E: Logistics and … 47 (2011) 6, pp. 933-946

-than-truckload (LTL) industry. It is formulated as a binary (0–1) multi-commodity minimum cost flow problem and solved using a branch …

Persistent link: https://www.econbiz.de/10011048969

Solving the Convex Cost Integer Dual Network Flow Problem

Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B. - In: Management Science 49 (2003) 7, pp. 950-964

of a minimum cost flow problem (that is, of the form \mu i- \mu j\le wij, (i,j)\in Q … solved inO(nmlog(n 2/m)log(nU)time. This time bound is the same time needed to solve the minimum cost flow problem …

Persistent link: https://www.econbiz.de/10009191756

A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem.

ORTEGA, Francisco; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2000

We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut...

Persistent link: https://www.econbiz.de/10005043458

50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today

Hochbaum, Dorit S. - In: Management Science 50 (2004) 6, pp. 709-723

Motivated by applications in freight handling and open-pit mining, Rhys, Balinski, and Picard studied the problems of selection and closure in papers published in Management Science in 1970 and 1976. They identified efficient algorithms based on linear programming and maximum-flow/minimum-cut...

Persistent link: https://www.econbiz.de/10009214522

On dual minimum cost flow algorithms

Vygen, Jens - In: Computational Statistics 56 (2002) 1, pp. 101-126

We describe a new dual algorithm for the minimum cost flow problem. It can be regarded as a variation of the best known … strongly polynomial minimum cost flow algorithm, due to Orlin. Indeed we obtain the same running time of O(m log m(m+n log n …

Persistent link: https://www.econbiz.de/10010847877