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

Author： Afsar Hasan Murat   Jozefowiez Nicolas   Lopez Pierre  

Publisher： Edp Sciences

E-ISSN： 1290-3868|45|4|353-364

ISSN： 0399-0559

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

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

A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

By Moukrim Aziz   Rebaine Djamal   Serairi Mehdi  

RAIRO - Operations Research, Vol. 48, Iss. 2, 2014-03 ,pp. : 235-254

Edp Sciences

Access to resources Recommend Favorite

A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times

By Duran Toksarı M.  

RAIRO - Operations Research, Vol. 50, Iss. 1, 2016-02 ,pp. : 211-219

Edp Sciences

Access to resources Recommend Favorite

A modified algorithm for the strict feasibility problem

By Benterki D.   Merikhi B.  

RAIRO - Operations Research, Vol. 35, Iss. 4, 2010-03 ,pp. : 395-399

Edp Sciences

Access to resources Recommend Favorite