An FPTAS for the parametric knapsack problem (Q2361499): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2017.06.006 / 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: Q2718910 / 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: A new fully polynomial time approximation scheme for the Knapsack problem / 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: Complexity of some parametric integer and network programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric shortest path algorithms with an application to cyclic staffing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the parametric maximum flow problem and some related reoptimization issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for the parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Solution for Linear Bicriteria Knapsack Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2017.06.006 / rank
 
Normal rank

Latest revision as of 05:14, 18 December 2024

scientific article
Language Label Description Also known as
English
An FPTAS for the parametric knapsack problem
scientific article

    Statements

    An FPTAS for the parametric knapsack problem (English)
    0 references
    0 references
    0 references
    30 June 2017
    0 references
    knapsack problems
    0 references
    parametric optimization
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references