Approximation schemes for the parametric knapsack problem (Q506160): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: A lower bound for the shortest path problem / 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: Generalization of a theorem on the parametric maximum flow 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: A note on the parametric maximum flow problem and some related reoptimization issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric mixed-integer 0-1 linear programming: The general case for a single parameter / 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: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse-parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting and counting segment intersections / rank
 
Normal rank

Revision as of 08:12, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for the parametric knapsack problem
scientific article

    Statements

    Approximation schemes for the parametric knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 January 2017
    0 references
    parametric optimization problems
    0 references
    approximation algorithms
    0 references
    bicriteria optimization problems
    0 references

    Identifiers