General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
From MaRDI portal
Publication:1957000
DOI10.1007/s10559-010-9206-1zbMath1208.90118OpenAlexW2041528445MaRDI QIDQ1957000
Publication date: 24 September 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9206-1
Related Items (7)
Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ On the complexity of calculating sensitivity parameters in Boolean programming problems ⋮ An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems ⋮ Sensitivity analysis of the knapsack problem: a negative result ⋮ Reoptimization of max \(k\)-cover: approximation ratio threshold ⋮ On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field ⋮ An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of postoptimality analysis of \(0/1\) programs
- On a quantitative measure of stability for a vector problem in integer programming
- Some concepts of stability analysis in combinatorial optimization
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Postoptimality analysis in zero‐one programming by implicit enumeration
This page was built for publication: General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
