Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems

DOI10.1016/0041-5553(87)90003-6zbMath0664.65063OpenAlexW2051265967MaRDI QIDQ3814665

Eh. N. Gordeev

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90003-6

zbMATH Keywords

algorithmsstabilitycombinatorial optimizationextremal problemspolynomial complexityweighted matroidtrajectory problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Some concepts of stability analysis in combinatorial optimization

This page was built for publication: Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems