Arborescence optimization problems solvable by Edmonds' algorithm

Author： Georgiadis L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 427-437

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 Branch and Bound algorithm for the minimax regret spanning arborescence

By Conde Eduardo  

Journal of Global Optimization, Vol. 37, Iss. 3, 2007-03 ,pp. : 467-480

Springer Publishing Company

Access to resources Recommend Favorite

On initial populations of a genetic algorithm for continuous optimization problems

By Maaranen Heikki   Miettinen Kaisa   Penttinen Antti  

Journal of Global Optimization, Vol. 37, Iss. 3, 2007-03 ,pp. : 405-436

Springer Publishing Company

Access to resources Recommend Favorite

A constructive algorithm of neural approximation models for optimization problems

By Carcangiu Sara   Fanni Alessandra   Montisci Augusto  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 28, Iss. 5, 2009-09 ,pp. : 1276-1289

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

By Schochetman I.E.  

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 119-142

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for computationally expensive engineering optimization problems

By Yoel Tenne  

International Journal of General Systems, Vol. 42, Iss. 5, 2013-07 ,pp. : 458-488

Taylor & Francis Ltd

Access to resources Recommend Favorite