Minimum cost spanning tree games and population monotonic allocation schemes

Author： Norde H.   Moretti S.   Tijs S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.154, Iss.1, 2004-04, pp. : 84-97

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

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

On generalized minimum spanning trees

By Feremans C.   Labbe M.   Laporte G.  

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

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

The vertex degrees of minimum spanning trees

By Cieslik D.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 278-282

Elsevier

Access to resources Recommend Favorite