Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
On the complexity of a class of combinatorial optimization problems with uncertainty
Home
Publications
On the complexity of a class of combinatorial optimization problems with uncertainty
On the complexity of a class of combinatorial optimization problems with uncertainty
Igor Averbakh
Igor Averbakh
Publisher Website
Google Scholar
Add to library
Cite
Download
Share
Download
1 April 2001
journal article
research article
Published by
Springer Nature
in
Mathematical Programming
Vol. 90
(2)
,
263-272
https://doi.org/10.1007/pl00011424
Abstract
No abstract available
Keywords
KEY WORDS: POLYNOMIAL ALGORITHM – COMPLEXITY – ROBUST OPTIMIZATION
Cited by 120 articles