z-logo
open-access-imgOpen Access
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
Author(s) -
Yuri Malitsky,
Meinolf Sellmann,
Radosław Szymanek
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7560
Subject(s) - knapsack problem , bounded function , sublinear function , change making problem , continuous knapsack problem , mathematics , binary number , representation (politics) , mathematical optimization , computer science , algorithm , discrete mathematics , arithmetic , mathematical analysis , politics , political science , law

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