O(log m)-approximation for the routing open shop problem∗

Publisher： Edp Sciences

E-ISSN： 1290-3868|49|2|383-391

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.2, 2015-01, pp. : 383-391

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 threshold accepting approach to the Open Vehicle Routing problem

By Tarantilis Christos D.   Ioannou George   Kiranoudis Chris T.   Prastacos Gregory P.  

RAIRO - Operations Research, Vol. 38, Iss. 4, 2010-03 ,pp. : 345-360

Edp Sciences

Access to resources Recommend Favorite

A Survey of Vehicle Routing Problem

By  

MATEC Web of conference, Vol. 100, Iss. issue, 2017-03 ,pp. : 01006-01006

Edp Sciences

Access to resources Recommend Favorite

Ant Foraging Behavior for Job Shop Problem

By Mahad Diyana Abdul  

MATEC Web of conference, Vol. 52, Iss. issue, 2016-04 ,pp. : 01005-01005

Edp Sciences

Access to resources Recommend Favorite

A memetic algorithm for the vehicle routing problem with time windows

By Labadi Nacima   Prins Christian   Reghioui Mohamed  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 415-431

Edp Sciences

Access to resources Recommend Favorite

The periodic Vehicle routing problem: classification and heuristic

By Mourgaya M.   Vanderbeck F.  

RAIRO - Operations Research, Vol. 40, Iss. 2, 2006-10 ,pp. : 169-194

Edp Sciences

Access to resources Recommend Favorite