Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

By Samphaiboon N.   Yamada Y.  

Journal of Optimization Theory and Applications, Vol. 105, Iss. 3, 2000-06 ,pp. : 659-676

Springer Publishing Company

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

An exact algorithm for the budget-constrained multiple knapsack problem

By You Byungjun   Yamada Takeo  

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3380-3393

Taylor & Francis Ltd

Access to resources Recommend Favorite

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

By Kamei Sayaka  

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 430-459

Springer Publishing Company

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