Computational algorithms for finding the radius of stability in problems of choice
From MaRDI portal
Publication:3682231
DOI10.1016/S0041-5553(83)80141-4zbMath0566.90056OpenAlexW2015003606MaRDI QIDQ3682231
V. K. Leont'ev, I. Kh. Sigal, Eh. N. Gordeev
Publication date: 1983
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0041-5553(83)80141-4
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (2)
Stability analysis for a special interval cutting problem ⋮ Some concepts of stability analysis in combinatorial optimization
This page was built for publication: Computational algorithms for finding the radius of stability in problems of choice