A maximum flow formulation of a multi-period open-pit mining problem

By Amankwah Henry   Larsson Torbjörn   Textorius Björn  

Operational Research, Vol. 14, Iss. 1, 2014-04 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

Improved heuristically guided genetic algorithm for the flow shop scheduling problem

By Laha Dipak   Mandal Purnendu  

International Journal of Services and Operations Management, Vol. 3, Iss. 3, 2007-04 ,pp. : 316-331

Inderscience Publishers

Access to resources Recommend Favorite

A genetic algorithm for the generalised sequencing problem for automated storage and retrieval systems

By Chung Eunyong   Lee H. Felix  

International Journal of Services Operations and Informatics, Vol. 3, Iss. 1, 2008-03 ,pp. : 90-106

Inderscience Publishers

Access to resources Recommend Favorite

Interfirm networks, social capital, and knowledge flow

By Mu Jifeng   Peng Gang   Love Edwin  

Journal of Knowledge Management, Vol. 12, Iss. 4, 2008-07 ,pp. : 86-100

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A branch-and-bound algorithm for the supply connected location-allocation problem on networks

By Yesilkokcen G.N.   Wesolowsky G.O.  

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 395-415

Elsevier

Access to resources Recommend Favorite