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

ISSN： 1382-6905

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

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

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

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming

By Yang Xinan Grothey Andreas

IMA Journal of Management Mathematics, Vol. 23, Iss. 4, 2012-10 ,pp. : 413-434

Oxford University Press

Access to resources Recommend Favorite

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi Guerriero Francesca

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite

A dynamic programming strategy to balance exploration and exploitation in the bandit problem

By Caelen Olivier Bontempi Gianluca

Annals of Mathematics and Artificial Intelligence, Vol. 60, Iss. 1-2, 2010-10 ,pp. : 3-24

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