We stand with Ukraine  

Mikita Hradovich

According to our database1, Mikita Hradovich authored at least 5 papers between 2016 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Robust recoverable 0-1 optimization problems under polyhedral uncertainty.
[BibTeX]
[DOI]
Mikita Hradovich
,
Adam Kasperski
,
Pawel Zielinski
Eur. J. Oper. Res., 2019

2017
The recoverable robust spanning tree problem with interval costs is polynomially solvable.
[BibTeX]
[DOI]
Mikita Hradovich
,
Adam Kasperski
,
Pawel Zielinski
Optim. Lett., 2017

Recoverable robust spanning tree problem under interval uncertainty representations.
[BibTeX]
[DOI]
Mikita Hradovich
,
Adam Kasperski
,
Pawel Zielinski
J. Comb. Optim., 2017

Risk Averse Scheduling with Scenarios.
[BibTeX]
[DOI]
Mikita Hradovich
,
Adam Kasperski
,
Pawel Zielinski
Proceedings of the Operations Research Proceedings 2017, 2017

2016
The robust recoverable spanning tree problem with interval costs is polynomially solvable.
[BibTeX]
[DOI]
Mikita Hradovich
,
Adam Kasperski
,
Pawel Zielinski
CoRR, 2016


  Loading...