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

A gamma heuristic for the p-median problem

By Rosing K.E.   ReVelle C.S.   Schilling D.A.  

European Journal of Operational Research, Vol. 117, Iss. 3, 1999-09 ,pp. : 522-532

Elsevier

Access to resources Recommend Favorite

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

By Katayama K.   Narihisa H.  

European Journal of Operational Research, Vol. 134, Iss. 1, 2001-10 ,pp. : 103-119

Elsevier

Access to resources Recommend Favorite

Unbounded knapsack problem: Dynamic programming revisited

By Andonov R.   Poirriez V.   Rajopadhye S.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 394-407

Elsevier

Access to resources Recommend Favorite

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

By Ernst A.T.   Krishnamoorthy M.  

European Journal of Operational Research, Vol. 104, Iss. 1, 1998-01 ,pp. : 100-112

Elsevier

Access to resources Recommend Favorite