Single-Row Transformation of Complete Graphs

By Salleh Shaharuddin   Olariu Stephan   Sanugi Bahrom   Aziz Mohd Ismail Abd  

The Journal of Supercomputing, Vol. 31, Iss. 3, 2005-03 ,pp. : 265-279

Springer Publishing Company

Access to resources Recommend Favorite

A new heuristic procedure for the single-row facility layout problem

By Djellab Housni   Gourgand Michel  

International Journal of Computer Integrated Manufacturing, Vol. 14, Iss. 3, 2001-05 ,pp. : 270-280

Taylor & Francis Ltd

Access to resources Recommend Favorite

Heuristics for single-row layout problems in flexible manufacturing systems

By Braglia M.  

Production Planning and Control, Vol. 8, Iss. 6, 1997-09 ,pp. : 558-567

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling loosely connected task graphs

By Ranade A.G.  

Journal of Computer and System Sciences, Vol. 67, Iss. 1, 2003-08 ,pp. : 198-208

Elsevier

Access to resources Recommend Favorite

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

By Chen Y-Chuang   Huang Yong-Zen   Hsu Lih-Hsing   Tan Jimmy  

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 229-238

Springer Publishing Company

Access to resources Recommend Favorite