The problem of the optimal biobjective spanning tree

Author： Ramos R.M. Alonso S. Sicilia J. Gonzalez C.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.111, Iss.3, 1998-12, pp. : 617-628

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 multiperiod degree constrained minimal spanning tree problem

By Kawatra R.

European Journal of Operational Research, Vol. 143, Iss. 1, 2002-11 ,pp. : 53-63

Elsevier

Access to resources Recommend Favorite

A multiperiod planning model for the capacitated minimal spanning tree problem

By Kawatra R. Bricker D.

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 412-419

Elsevier

Access to resources Recommend Favorite

Genetic algorithm approach on multi-criteria minimum spanning tree problem

By Zhou G. Gen M.

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 141-152

Elsevier

Access to resources Recommend Favorite

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

By Gouveia L. Requejo C.

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 539-552

Elsevier

Access to resources Recommend Favorite

Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values*

By Longcheng Liu Yong He

Progress in Natural Science, Vol. 16, Iss. 6, 2006-06 ,pp. : 649-655

Taylor & Francis Ltd

Access to resources Recommend Favorite