On the complexity of postoptimality analysis of \(0/1\) programs
type: Item
instance of: scholarly article
title: On the complexity of postoptimality analysis of \(0/1\) programs
zbMATH Open document ID: 0917.90250
DOI: 10.1016/S0166-218X(98)00151-6
author: Albert P. M. Wagelmans
author: Stan Van Hoesel
published in: Discrete Applied Mathematics
publication date: 1999-08-05T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1271077
zbMATH Keywords: postoptimality analysis
zbMATH Keywords: \(\varepsilon\)-optimal solutions
zbMATH Keywords: NP-hard 0/1 problems
MaRDI profile type: Publication
cites work: Calculation of stability radii for combinatorial optimization problems
cites work: Q4194726
cites work: Q3328278
cites work: Q4377042
cites work: Q3701213
cites work: Optimal schedules with infinitely large stability radius∗
cites work: Solving the \(k\)-best traveling salesman problem
cites work: The stability of the approximate Boolean minimization of a linear form
cites work: Some concepts of stability analysis in combinatorial optimization
cites work: On the calculation of the stability radius of an optimal or an approximate schedule
cites work: The Tolerance Approach to Sensitivity Analysis in Linear Programming
Recommended article: An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
Recommended article: General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
Recommended article: Post-Optimal Analysis of Linear Semi-Infinite Programs
Recommended article: Postoptimal Analysis in Nonserial Dynamic Programming
Recommended article: On complexity of unconstrained hyperbolic 0--1 programming problems
Recommended article: Q4530147
Recommended article: On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
Recommended article: An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
Recommended article: A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
Recommended article: On the complexity of semidefinite programs
description: scientific article; zbMATH DE number 1271077