Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

ISSN： 0022-3239

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

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

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

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

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

By Chudak F.A. Shmoys D.B.

Journal of Algorithms, Vol. 30, Iss. 2, 1999-02 ,pp. : 323-343

Academic Press

Access to resources Recommend Favorite

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

By Mofya E. Smith J.

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 231-256

Springer Publishing Company

Access to resources Recommend Favorite

Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors

By Cui Yaodong Wang Qiang

Journal of Combinatorial Optimization, Vol. 14, Iss. 1, 2007-07 ,pp. : 35-44

Springer Publishing Company

Access to resources Recommend Favorite