Move based heuristics for the unidirectional loop network layout problem

Author： Tansel B.C.   Bilen C.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.108, Iss.1, 1998-07, pp. : 36-48

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

Neural and delay based heuristics for the Steiner problem in networks

By Ghanwani A.  

European Journal of Operational Research, Vol. 108, Iss. 2, 1998-07 ,pp. : 241-265

Elsevier

Access to resources Recommend Favorite

Improvement heuristics for the Vehicle Routing Problem based on Simulated Annealing

By Van Breedam A.  

European Journal of Operational Research, Vol. 86, Iss. 3, 1995-11 ,pp. : 480-490

Elsevier

Access to resources Recommend Favorite

The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming

By Antonio J.   Chauvet F.   Chu C.   Proth J.-M.  

European Journal of Operational Research, Vol. 114, Iss. 2, 1999-04 ,pp. : 395-402

Elsevier

Access to resources Recommend Favorite

Two simulated annealing-based heuristics for the job shop scheduling problem

By Steinhofel K.   Albrecht A.   Wong C.K.  

European Journal of Operational Research, Vol. 118, Iss. 3, 1999-11 ,pp. : 524-548

Elsevier

Access to resources Recommend Favorite

Heuristics for the container loading problem

By Pisinger D.  

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 382-392

Elsevier

Access to resources Recommend Favorite