The computational complexity of the criticality problems in a network with interval activity times

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.136, Iss.3, 2002-02, pp. : 541-550

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

Network distance characteristics that affect computational effort in p-median location problems

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

European Journal of Operational Research, Vol. 127, Iss. 3, 2000-12 ,pp. : 525-536

Elsevier

Access to resources Recommend Favorite

Generalized network design problems

By Feremans C. Labbe M. Laporte G.

European Journal of Operational Research, Vol. 148, Iss. 1, 2003-07 ,pp. : 1-13

Elsevier

Access to resources Recommend Favorite

Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks

By Nachtigall K. Voget S.

European Journal of Operational Research, Vol. 103, Iss. 3, 1997-12 ,pp. : 610-627

Elsevier

Access to resources Recommend Favorite

Complexity of mixed shop scheduling problems: A survey

By Shakhlevich N.V. Sotskov Y.N. Werner F.

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 343-351

Elsevier

Access to resources Recommend Favorite

A neural network model for scheduling problems

By Sabuncuoglu I. Gurgun B.

European Journal of Operational Research, Vol. 93, Iss. 2, 1996-09 ,pp. : 288-299

Elsevier

Access to resources Recommend Favorite