Similar Search Results

A Comparison of Optimal Methods for Local Access Uncapacitated Network Design

Randazzo, C.D.; Luna, H.P.L. - 2001

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

A Survey of Algorithms for Convex Multicommodity Flow Problems

Ouorou, A.; Mahey, P.; Vial, J.-Ph. - In: Management Science 46 (2000) 1, pp. 126-147

Routing problems appear frequently when dealing with the operation of communication or transportation networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation for this work comes from this problem which is shown...

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

A Survey of Algorithms for Convex Multicommodity Flow Problems

Ouorou, A.; Mahey, P.; Vial, J.-Ph - In: Management science : journal of the Institute for … 46 (2000) 1, pp. 126-147

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

A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

Ouorou, A.; Mahey, P. - In: European journal of operational research : EJOR 121 (2000) 3, pp. 532-548

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

Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths

Vatinlen, B.; Chauvet, F.; Chrétienne, P.; Mahey, P. - In: European journal of operational research : EJOR 185 (2008) 3, pp. 1390-1401

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

Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

Mahey, P.; de Souza, M.C. - In: Operations research letters 35 (2007) 2, pp. 221-226

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

A Survey of Algorithms for Convex Multicommodity Flow Problems.

Ouorou, A.; Mahey, P.; Vial, P. PH. - Geneva School of Economics and Management, Université … - 1997

There are many problems related to design a networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation of this work comes from this problem which is shown to belong to the lass of nonlinear convex multicomodity...

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

Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths

Vatinlen, B.; Chauvet, F.; Chretienne, P.; Mahey, P. - In: European Journal of Operational Research 185 (2008) 3, pp. 1390-1401

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

A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

Ouorou, A.; Mahey, P. - In: European Journal of Operational Research 121 (2000) 3, pp. 532-548

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