Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems
From MaRDI portal
Publication:3814665
DOI10.1016/0041-5553(87)90003-6zbMath0664.65063OpenAlexW2051265967MaRDI QIDQ3814665
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
algorithmsstabilitycombinatorial optimizationextremal problemspolynomial complexityweighted matroidtrajectory problems
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (1)
This page was built for publication: Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems