Algorithms for the bounded set-up knapsack problem (Q2467131): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029343066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Certain Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Algorithm for One-Dimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer knapsack problems with set-up weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multilevel passenger screening problem for aviation security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting cover inequalities for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming revisited: Improving knapsack algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank

Latest revision as of 15:31, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for the bounded set-up knapsack problem
scientific article

    Statements

    Algorithms for the bounded set-up knapsack problem (English)
    0 references
    0 references
    0 references
    18 January 2008
    0 references
    0 references
    knapsack problems
    0 references
    dynamic programming
    0 references
    fully polynomial-time approximation schemes
    0 references
    0 references