Local search for the Steiner tree problem in the Euclidean plane

Author： Zachariasen M.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.119, Iss.2, 1999-12, pp. : 282-300

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 tree search algorithm for the crew scheduling problem

By Beasley J.E.   Cao B.  

European Journal of Operational Research, Vol. 94, Iss. 3, 1996-11 ,pp. : 517-526

Elsevier

Access to resources Recommend Favorite

Lexicographic local search and the p-center problem

By Hassin R.   Levin A.   Morad D.  

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 265-279

Elsevier

Access to resources Recommend Favorite

An optimal tree search method for the manufacturing systems cell formation problem

By Spiliopoulos K.   Sofianopoulou S.  

European Journal of Operational Research, Vol. 105, Iss. 3, 1998-03 ,pp. : 537-551

Elsevier

Access to resources Recommend Favorite

A multiple-tree search procedure for the resource-constrained project scheduling problem

By Simpson W.P.   Patterson J.H.  

European Journal of Operational Research, Vol. 89, Iss. 3, 1996-03 ,pp. : 525-542

Elsevier

Access to resources Recommend Favorite

Combination of local search and CLP in the vehicle-fleet scheduling problem

By Psarras J.   Stefanitsis E.   Christodoulou N.  

European Journal of Operational Research, Vol. 98, Iss. 3, 1997-05 ,pp. : 512-521

Elsevier

Access to resources Recommend Favorite