On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems

DOI10.1007/s10559-010-9262-6zbMath1305.90423OpenAlexW2029632322MaRDI QIDQ466348

Victor A. Mikhailyuk

Publication date: 27 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-010-9262-6

zbMATH Keywords

postoptimality analysiscompletely unimodular matrixcomplexity of the branch and bound method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems ⋮ An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems