On the complexity of postoptimality analysis of 0/1 programs

Sensitivity Analysis for Scheduling Problems

Journal of Scheduling

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 Shortest Common Superstring Problem

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching

Integer Programming: Optimization and Evaluation Are Equivalent

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Reoptimization of the metric deadline TSP

Journal of Discrete Algorithms

General approach to estimating the complexity of postoptimality analysis for discrete optimization problems

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

Knowing all optimal solutions does not help for TSP reoptimization

Computation, cooperation, and life

Some basics on tolerances

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

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