An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems

DOI10.1007/s10559-012-9459-yzbMath1307.90213OpenAlexW2035566361MaRDI QIDQ2263220

Victor A. Mikhailyuk

Publication date: 18 March 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9459-y

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• 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
• Computational Complexity

This page was built for publication: An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems