A dynamic programming algorithm for the local access telecommunication network expansion problem

Author： Flippo O.E. Kolen A.W.J. Koster A.M.C.A. van de Leensel R.L.M.J.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.127, Iss.1, 2000-11, pp. : 189-202

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

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

By Malandraki C. Dial R.B.

European Journal of Operational Research, Vol. 90, Iss. 1, 1996-04 ,pp. : 45-55

Elsevier

Access to resources Recommend Favorite

A suboptimal solution to a hierarchial network design problem using dynamic programming

By Sancho N.G.F.

European Journal of Operational Research, Vol. 83, Iss. 1, 1995-05 ,pp. : 237-244

Elsevier

Access to resources Recommend Favorite

A dynamic programming-based particle swarm optimization algorithm for an inventory management problem under uncertainty

By Xu Jiuping

Engineering Optimization, Vol. 45, Iss. 7, 2013-07 ,pp. : 851-880

Taylor & Francis Ltd

Access to resources Recommend Favorite

A multi-period network design problem for cellular telecommunication systems

By Kubat P. Smith J.M.

European Journal of Operational Research, Vol. 134, Iss. 2, 2001-10 ,pp. : 439-456

Elsevier

Access to resources Recommend Favorite

A contraction algorithm for the multiparametric integer linear programming problem

By Crema A.

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 130-139

Elsevier

Access to resources Recommend Favorite