Locating Sources to Meet Flow Demands in Undirected Networks

Author： Arata K. Iwata S. Makino K. Fujishige S.

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.42, Iss.1, 2002-01, pp. : 54-68

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new strategy for the undirected two-commodity maximum flow problem

By Sedeño-Noda A. González-Martín C. Alonso-Rodríguez S.

Computational Optimization and Applications, Vol. 47, Iss. 2, 2010-10 ,pp. : 289-305

Springer Publishing Company

Access to resources Recommend Favorite

A novel PM-wear protection method to meet high comminution demands

By Theisen W.

Wear, Vol. 250, Iss. 1, 2001-10 ,pp. : 54-58

Elsevier

Access to resources Recommend Favorite

Exploring Unknown Undirected Graphs

By Panaite P. Pelc A.

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 281-295

Academic Press

Access to resources Recommend Favorite

Efficient controls for traffic flow on networks

By D’Apice C.

Journal of Dynamical and Control Systems, Vol. 16, Iss. 3, 2010-07 ,pp. : 407-437

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Control for Traffic Flow Networks

By Gugat M. Herty M. Klar A. Leugering G.

Journal of Optimization Theory and Applications, Vol. 126, Iss. 3, 2005-09 ,pp. : 589-616

Springer Publishing Company

Access to resources Recommend Favorite