On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
type: Item
instance of: scholarly article
title: On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
zbMATH Open document ID: 1305.90423
published in: Cybernetics and Systems Analysis
publication date: 2014-10-27T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6361625
zbMATH Keywords: postoptimality analysis
zbMATH Keywords: complexity of the branch and bound method
zbMATH Keywords: completely unimodular matrix
author: Victor A. Mikhailyuk
MaRDI profile type: Publication
full work available at URL: s10559-010-9262-6
OpenAlex ID: W2029632322
cites work: Stability, parametric, and postoptimality analysis of discrete optimization problems
cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
cites work: Postoptimality analysis in zero‐one programming by implicit enumeration
cites work: Q4377042
cites work: Q4145159
cites work: Q3115678
DOI: 10.1007/S10559-010-9262-6
description: scientific article; zbMATH DE number 6361625