The inverse-parametric knapsack problem (Q1388831): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rainer E. Burkard / rank
Normal rank
 
Property / author
 
Property / author: Rainer E. Burkard / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest flow 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: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric approaches to fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / 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: Computational complexity of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:55, 28 May 2024

scientific article
Language Label Description Also known as
English
The inverse-parametric knapsack problem
scientific article

    Statements

    The inverse-parametric knapsack problem (English)
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    0 references
    parametric programming
    0 references
    parametric knapsack problems
    0 references
    inverse-parametric problem pseudopolynomial algorithms
    0 references