论文信息 - Potential-driven flows in capacitated networks - 字舞流文

Potential-driven flows in capacitated networks

Aurélie Thiele | A. Thiele

[1] V Marianov,et al. Survivable capacitated network design problem: new formulation and Lagrangean relaxation , 2000, J. Oper. Res. Soc..

[2] Ramesh Bhandari. Survivable Networks: Algorithms for Diverse Routing , 1998 .

[3] H. Pirkul,et al. New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[4] Thomas L. Magnanti,et al. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[5] Stephen C. Graves,et al. A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[6] Sita Bhaskaran,et al. Optimal Design of Gas Pipeline Networks , 1979 .

[7] Sita Bhaskaran,et al. Optimal diameter assignment for gas pipeline networks , 1979 .

[8] M. Bazaraa,et al. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[9] Jan Karel Lenstra,et al. The complexity of the network design problem , 1978, Networks.