Some concepts of stability analysis in combinatorial optimization
- 24 March 1995
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 58 (2), 169-190
- https://doi.org/10.1016/0166-218x(93)e0126-j
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial OrderingProbability in the Engineering and Informational Sciences, 1991
- On the Numerical Stability of Simplex-AlgorithmsOptimization, 1987
- Sensitive and parametric analysis of the maximum flow in a networkMathematische Operationsforschung und Statistik. Series Optimization, 1984
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- The value function of an integer programMathematical Programming, 1982
- A shortest augmenting path method for solving minimal perfect matching problemsNetworks, 1981
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear ProgrammingManagement Science, 1977
- Stability in Nonlinear ProgrammingOperations Research, 1970
- Sensitivity Analysis of Multiterminal Flow NetworksOperations Research, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959