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

DOI10.1007/S10559-010-9262-6MaRDI QIDQ466348zbMATH OpenOpenAlexFDO

Authors 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) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• 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
• On the complexity of postoptimality analysis of 0/1 programs
• An asymptotic estimate for the complexity of the branch and bound method with branching with respect to a fractional variable for the knapsack problem

Cites work

• scientific article; zbMATH DE number 3575370 (Why is no real title available?)
• scientific article; zbMATH DE number 1114459 (Why is no real title available?)
• An asymptotic estimate for the complexity of the branch and bound method with branching with respect to a fractional variable for the knapsack problem
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Postoptimality analysis in zero‐one programming by implicit enumeration
• Stability, parametric, and postoptimality analysis of discrete optimization problems

Cited in

(4)

• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• 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
• On the complexity of postoptimality analysis of 0/1 programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466348)