Assessing the effect of multiple cost changes using reverse set tolerances
From MaRDI portal
Recommendations
- Extending single tolerances to set tolerances
- Some Basics on Tolerances
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- A note on robustness tolerances for combinatorial optimization problems
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Cites work
- An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Assignment Problems
- Extending single tolerances to set tolerances
- Lower tolerance-based branch and bound algorithms for the ATSP
- On different approximation criteria for subset product problems
- On the complexity of postoptimality analysis of 0/1 programs
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Some Basics on Tolerances
- Stability and Regularization of Vector Problems of Integer Linear Programming
- The Min-Max Spanning Tree Problem and some extensions
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- The traveling salesman problem and its variations
- Tolerance-based branch and bound algorithms for the ATSP
Cited in
(2)
This page was built for publication: Assessing the effect of multiple cost changes using reverse set tolerances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558690)
