The inverse-parametric knapsack problem

DOI10.1016/0377-2217(95)00014-HzbMath0904.90121OpenAlexW2091270504MaRDI QIDQ1388831

Ulrich Pferschy, Rainer E. Burkard

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00014-h

zbMATH Keywords

parametric programminginverse-parametric problem pseudopolynomial algorithmsparametric knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

Approximation schemes for the parametric knapsack problem ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Optimization with additional variables and constraints ⋮ An FPTAS for the knapsack problem with parametric weights

Cites Work

• Unnamed Item
• Unnamed Item
• The quickest path problem
• Heuristic algorithms for the multiple knapsack problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• The all-pairs quickest path problem
• Complexity of some parametric integer and network programming problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• Computational complexity of parametric linear programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The quickest flow problem
• Fractional knapsack problems
• Approximation algorithms for combinatorial fractional programming problems
• Parametric approaches to fractional programs
• A bad network problem for the simplex method and other minimum cost flow algorithms

This page was built for publication: The inverse-parametric knapsack problem