Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

By Hifi Mhand   Mhalla Hedi   Sadfi Slim  

Journal of Combinatorial Optimization, Vol. 10, Iss. 3, 2005-11 ,pp. : 239-260

Springer Publishing Company

Access to resources Recommend Favorite

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

By Kellerer Hans   Pferschy Ulrich  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 5-11

Springer Publishing Company

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

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 polyhedral study of the semi-continuous knapsack problem

By Farias Ismael   Zhao Ming  

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 169-203

Elsevier

Access to resources Recommend Favorite