Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
From MaRDI portal
Publication:6097849
DOI10.1007/s10288-022-00509-1zbMath1519.90240MaRDI QIDQ6097849
Mikhail Y. Kovalyov, Nir Halman, Alain Quilliot
Publication date: 7 June 2023
Published in: 4OR (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Approximation schemes for the parametric knapsack problem
- Parametric shortest path algorithms with an application to cyclic staffing
- Generalization of a theorem on the parametric maximum flow problem
- An approximation algorithm for a general class of parametric optimization problems
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for the parametric knapsack problem
- A note on the parametric maximum flow problem and some related reoptimization issues
- A fast parametric assignment algorithm with applications in max-algebra
- Nonlinear one-parametric bottleneck linear programming
- Complexity of some parametric integer and network programming problems
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Combinatorial Optimization with Rational Objective Functions
- Computational complexity of parametric linear programming
- Parametric Solution for Linear Bicriteria Knapsack Models
- A Fast Parametric Maximum Flow Algorithm and Applications
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Using sparsification for parametric minimum spanning tree problems
- Faster parametric shortest path and minimum‐balance algorithms
- A lower bound for the shortest path problem
This page was built for publication: Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
