Two sensitivity theorems in fuzzy integer programming.
From MaRDI portal
Publication:1421465
DOI10.1016/S0166-218X(03)00338-XzbMath1043.90049OpenAlexW1984777819MaRDI QIDQ1421465
Nikolaj Nikolaevich Kuzyurin, Armen S. Asratian
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00338-x
Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Cites Work
- On the ratio of optimal integral and fractional covers
- Sensitivity theorems in integer linear programming
- A Greedy Heuristic for the Set-Covering Problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Linear programming without the matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two sensitivity theorems in fuzzy integer programming.