The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

Publisher： John Wiley & Sons Inc

E-ISSN： 1520-6750|62|4|267-292

ISSN： 0894-069X

Source： Naval Research Logistics: An International Journal, Vol.62, Iss.4, 2015-06, pp. : 267-292

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

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

A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem

By Claro João   Sousa Jorge  

Computational Optimization and Applications, Vol. 46, Iss. 3, 2010-07 ,pp. : 427-450

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

Sensitivity analysis of the knapsack problem: a negative result

By Mikhailyuk V.  

Cybernetics and Systems Analysis, Vol. 49, Iss. 2, 2013-03 ,pp. : 201-204

Springer Publishing Company

Access to resources Recommend Favorite