An FPTAS for the knapsack problem with parametric weights (Q2294221): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604456416 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.06048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse-parametric knapsack problem / 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 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: 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: Approximation schemes for the parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for the parametric knapsack 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: Parametric shortest path algorithms with an application to cyclic staffing / 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: 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: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / 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: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank

Latest revision as of 18:23, 21 July 2024

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

    Statements

    An FPTAS for the knapsack problem with parametric weights (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problems
    0 references
    parametric optimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references