Complexity of determining exact tolerances for min-max combinatorial optimization problems
Year of publication: |
2000
|
---|---|
Authors: | Ramaswamy, R. ; Chakravarti, Nilotpal ; Ghosh, D. |
Publisher: |
Groningen |
Subject: | Mathematische Optimierung | Mathematical programming | Sensitivitätsanalyse | Sensitivity analysis | Theorie | Theory |
-
Procurement strategy with credit risk
Wang, Hsiao-fan, (2013)
-
Kasperska, Elżbieta, (2013)
-
Use of the reduced tolerance approach to rank efficient solutions
Sitarz, Sebastian, (2013)
- More ...
-
Sensitivity analysis of the greedy heuristic for binary Knapsack problems
Ghosh, D., (2000)
-
Complexity of determining exact tolerances for min-max combinatorial optimization problems
Ramaswamy, R., (2000)
-
Centralized Bargaining, Efficiency Wages, and Flexibility
Ramaswamy, Ramana, (1993)
- More ...