Capacity scaling algorithm for scalable M-convex submodular flow problems

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.18, Iss.2, 2003-04, pp. : 207-218

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

On (n, m)-Convex Sets

By Zelinskii Y.B. Momot I.V.

Ukrainian Mathematical Journal, Vol. 53, Iss. 3, 2001-03 ,pp. : 482-487

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm to solve polyhedral convex set optimization problems

By Schrage Carola

Optimization, Vol. 62, Iss. 1, 2013-01 ,pp. : 131-141

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

By Ariyawansa K.A. Jiang P.L.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 2, 2000-11 ,pp. : 223-243

Springer Publishing Company

Access to resources Recommend Favorite

A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties

By Li Yu Du Donglei Xiu Naihua Xu Dachuan

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 609-620

Springer Publishing Company

Access to resources Recommend Favorite

Inverse Problems of Submodular Functions on Digraphs

By Cai M. Yang X. Li Y.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 3, 2000-03 ,pp. : 559-575

Springer Publishing Company

Access to resources Recommend Favorite