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

Author： Fouilhoux Pierre   Questel Aurélien  

Publisher： Edp Sciences

E-ISSN： 1290-3868|48|2|167-188

ISSN： 0399-0559

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

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-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

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

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

By Barahona Francisco   Ladányi László  

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

Edp Sciences

Access to resources Recommend Favorite

A branch-and-price algorithm for the windy rural postman problem

By Afsar Hasan Murat   Jozefowiez Nicolas   Lopez Pierre  

RAIRO - Operations Research, Vol. 45, Iss. 4, 2012-03 ,pp. : 353-364

Edp Sciences

Access to resources Recommend Favorite

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

By Meira Luis A.A.   Miyazawa Flávio K.  

RAIRO - Operations Research, Vol. 45, Iss. 2, 2011-06 ,pp. : 75-100

Edp Sciences

Access to resources Recommend Favorite