Key‐nodes selection problem for minimum cost control of directed networks

E-ISSN： 1099-1514|39|1|95-113

ISSN： 0143-2087

Source： Optimal Control Applications And Methods, Vol.39, Iss.1, 2018-01, pp. : 95-113

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

The biobjective minimum cost flow problem

By Sedeno-Noda A. Gonzalez-Martn C.

European Journal of Operational Research, Vol. 124, Iss. 3, 2000-08 ,pp. : 591-600

Elsevier

Access to resources Recommend Favorite

Heuristic algorithms for the portfolio selection problem with minimum transaction lots

By Mansini R. Speranza M.G.

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

Elsevier

Access to resources Recommend Favorite

Optimal procedures for the discrete time/cost trade-off problem in project networks

By Demeulemeester E.L. Herroelen W.S. Elmaghraby S.E.

European Journal of Operational Research, Vol. 88, Iss. 1, 1996-01 ,pp. : 50-68

Elsevier

Access to resources Recommend Favorite

The concave cost supply problem

By Chauhan S.S. Proth J.-M.

European Journal of Operational Research, Vol. 148, Iss. 2, 2003-07 ,pp. : 374-383

Elsevier

Access to resources Recommend Favorite

On the flow cost lowering problem

By Demgensky I. Noltemeier H. Wirth H.-C.

European Journal of Operational Research, Vol. 137, Iss. 2, 2002-03 ,pp. : 265-271

Elsevier

Access to resources Recommend Favorite