The Quasistability Criterion for a Vector Path Problem with a Majority Principle of Optimality
Cybernetics and Systems Analysis
Stability of Discrete Vector Problems with the Parametric Principle of Optimality
Cybernetics and Systems Analysis
Sensitivity Analysis for Scheduling Problems
Journal of Scheduling
Stability in the Combinatorial Vector Optimization Problems
Automation and Remote Control
Cybernetics and Systems Analysis
Reoptimization of the Metric Deadline TSP
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Approximation hardness of deadline-TSP reoptimization
Theoretical Computer Science
Reoptimization of the metric deadline TSP
Journal of Discrete Algorithms
Cybernetics and Systems Analysis
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A note on robustness tolerances for combinatorial optimization problems
Information Processing Letters
Postoptimal analysis of a vector minimax combinatorial problem
Cybernetics and Systems Analysis
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Optimal makespan scheduling with given bounds of processing times
Mathematical and Computer Modelling: An International Journal
Stability of a schedule minimizing mean flow time
Mathematical and Computer Modelling: An International Journal
Approximating the stability region for binary mixed-integer programs
Operations Research Letters
Quantitative stability analysis for vector problems of 0-1 programming
Discrete Optimization
Calculation of stability radii for combinatorial optimization problems
Operations Research Letters
Vyacheslav Tanaev: contributions to scheduling and related areas
Journal of Scheduling
| Hi-index | 0.00 |