On a cutting plane heuristic for the stable roommates problem and its applications

Author： Teo C.-P.   Sethuraman J.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.123, Iss.1, 2000-05, pp. : 195-205

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

Heuristic and exact methods for the cutting sequencing problem

By Faggioli E.   Bentivoglio C.A.  

European Journal of Operational Research, Vol. 110, Iss. 3, 1998-11 ,pp. : 564-575

Elsevier

Access to resources Recommend Favorite

A simulated annealing heuristic for the one-dimensional cutting stock problem

By Chuen-Lung S.C.   Hart S.M.   Wai M.T.  

European Journal of Operational Research, Vol. 93, Iss. 3, 1996-09 ,pp. : 522-535

Elsevier

Access to resources Recommend Favorite

A cutting plane algorithm for the unrelated parallel machine scheduling problem

By Mokotoff E.   Chretienne P.  

European Journal of Operational Research, Vol. 141, Iss. 3, 2002-09 ,pp. : 515-525

Elsevier

Access to resources Recommend Favorite

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

By Belov G.   Scheithauer G.  

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

Elsevier

Access to resources Recommend Favorite

A sequential heuristic procedure for one-dimensional cutting

By Gradisar M.   Kljajic M.   Resinovic G.   Jesenko J.  

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 557-568

Elsevier

Access to resources Recommend Favorite