Approximating the stability region for binary mixed-integer programs
type: Item
instance of: scholarly article
title: Approximating the stability region for binary mixed-integer programs
zbMATH Open document ID: 1167.90605
author: Fatma Kılınç-Karzan
author: Alejandro Toriello
author: S. Ahmed
author: G. L. Nemhauser
author: Martin W. P. Savelsbergh
published in: Operations Research Letters
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5595322
zbMATH Keywords: real-time optimization
zbMATH Keywords: stability analysis
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: binary integer programming
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: j.orl.2009.04.001
OpenAlex ID: W2109462722
cites work: Some concepts of stability analysis in combinatorial optimization
cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
cites work: SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
cites work: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
cites work: The value function of an integer program
cites work: Three methods for postoptimal analysis in integer linear programming
cites work: Sensitivity Analysis for Branch and Bound Integer Programming
cites work: Calculation of stability radii for combinatorial optimization problems
cites work: On the complexity of postoptimality analysis of \(0/1\) programs
cites work: Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
DOI: 10.1016/J.ORL.2009.04.001
description: scientific article; zbMATH DE number 5595322