z-logo
open-access-imgOpen Access
An exact algorithm for 0-1 polynomial knapsack problems
Author(s) -
Xiaoling Sun,
Sheng Hong-bo,
Duan Li
Publication year - 2007
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2007.3.223
Subject(s) - knapsack problem , mathematical optimization , continuous knapsack problem , polynomial time approximation scheme , heuristic , branch and bound , constraint (computer aided design) , mathematics , lagrangian , algorithm , dual (grammatical number) , computer science , polynomial , art , mathematical analysis , geometry , literature

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom