Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

Author： Barahona Francisco   Ladányi László  

Publisher： Edp Sciences

E-ISSN： 1290-3868|40|1|53-73

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.40, Iss.1, 2006-07, pp. : 53-73

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-price-and-cut algorithm for the pattern minimization problem

By Alves Cláudio   Valério de Carvalho J.M.  

RAIRO - Operations Research, Vol. 42, Iss. 4, 2009-04 ,pp. : 435-453

Edp Sciences

Access to resources Recommend Favorite

A branch-and-cut algorithm for a resource-constrained scheduling problem

By Sirdey Renaud   Kerivin Hervé L. M.  

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 235-251

Edp Sciences

Access to resources Recommend Favorite

Constrained Steiner trees in Halin graphs

By Chen Guangting   Burkard Rainer E.  

RAIRO - Operations Research, Vol. 37, Iss. 3, 2010-03 ,pp. : 179-194

Edp Sciences

Access to resources Recommend Favorite

The Order of Attraction of Drosophila Species to Cut Palm Trees

By  

Ecology, Vol. 36, Iss. 1, 1955-01 ,pp. : 153-155

John Wiley & Sons Inc

Access to resources Recommend Favorite

A branch-and-cut for the Non-Disjoint m-Ring-Star Problem

By Fouilhoux Pierre   Questel Aurélien  

RAIRO - Operations Research, Vol. 48, Iss. 2, 2014-03 ,pp. : 167-188

Edp Sciences

Access to resources Recommend Favorite