A non-cooperative approach to the cost spanning tree problem

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.59, Iss.3, 2004-07, pp. : 393-403

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

Efficient Edge‐swapping heuristics for the reload cost spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 380-394

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the probabilistic min spanning tree Problem

By Boria Nicolas

Journal of Mathematical Modelling and Algorithms, Vol. 11, Iss. 1, 2012-03 ,pp. : 45-76

Springer Publishing Company

Access to resources Recommend Favorite

A system of equilibria for non-cooperative games

By Smol’yakov E.

Computational Mathematics and Modeling, Vol. 18, Iss. 2, 2007-04 ,pp. : 157-166

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms to solve the knapsack constrained maximum spanning tree problem

By Takeo Yamada Kohtaro Watanabe Seiji Kataoka

International Journal of Computer Mathematics, Vol. 82, Iss. 1, 2005-01 ,pp. : 23-34

Taylor & Francis Ltd

Access to resources Recommend Favorite

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

By Hong S.-P. Chung S.-J. Park B.H.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 233-239

Elsevier

Access to resources Recommend Favorite