An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
DOI10.1007/S10559-011-9366-7zbMATH Open1358.68144OpenAlexW2025873233MaRDI QIDQ464980FDOQ464980
Authors: Victor A. Mikhailyuk 
Publication date: 30 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-011-9366-7
Recommendations
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- On the complexity of postoptimality analysis of \(0/1\) programs
- scientific article; zbMATH DE number 808811
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- On the theory of average case complexity
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Average case completeness
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- Average Case Complete Problems
- Title not available (Why is that?)
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- Postoptimality analysis in zero‐one programming by implicit enumeration
Cited In (5)
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
- Analysis-aware defeaturing: Problem setting and a posteriori estimation
- On the complexity of postoptimality analysis of \(0/1\) programs
This page was built for publication: An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464980)
