A Branch-and-Bound Algorithm for Concave Network Flow Problems

Author： Fontes Dalila   Hadjiconstantinou Eleni   Christofides Nicos  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.34, Iss.1, 2006-01, pp. : 127-155

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 Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

By Kuno Takahito  

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

By Ronconi Débora  

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

By Yan Shangyao   Shih Yu-Lin   Lee Wang-Tsang  

Journal of Global Optimization, Vol. 49, Iss. 4, 2011-04 ,pp. : 539-559

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy branch-and-bound algorithm for flow shop scheduling: Intelligent Manufacturing Systems: Vision for the Future (Guest Editors: Ercan Öztemel, Cemalettin Kubat and Harun Taşkin)

By Temİz İzzettİn   Erol Serpİl  

Journal of Intelligent Manufacturing, Vol. 15, Iss. 4, 2004-08 ,pp. : 449-454

Springer Publishing Company

Access to resources Recommend Favorite

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

By Aloise Daniel   Hansen Pierre  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 449-465

Springer Publishing Company

Access to resources Recommend Favorite