A branch-and-bound algorithm for the mini-max spanning forest problem

By Yamada T.   Takahashi H.   Kataoka S.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 93-103

Elsevier

Access to resources Recommend Favorite

A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem

By Vigo D.  

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 108-126

Elsevier

Access to resources Recommend Favorite

Genetic algorithm approach on multi-criteria minimum spanning tree problem

By Zhou G.   Gen M.  

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 141-152

Elsevier

Access to resources Recommend Favorite

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

By Malandraki C.   Dial R.B.  

European Journal of Operational Research, Vol. 90, Iss. 1, 1996-04 ,pp. : 45-55

Elsevier

Access to resources Recommend Favorite

The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

By Deitch R.   Ladany S.P.  

European Journal of Operational Research, Vol. 127, Iss. 1, 2000-11 ,pp. : 69-77

Elsevier

Access to resources Recommend Favorite