Robust approach to restricted items selection problem
From MaRDI portal
Publication:828685
DOI10.1007/S11590-020-01626-8zbMath1466.90063arXiv1907.09242OpenAlexW3048961104MaRDI QIDQ828685
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.09242
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity and in-approximability of a selection problem in robust optimization
- Exact and heuristic algorithms for the interval data robust assignment problem
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- The polynomial-time hierarchy
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Approximability of the robust representatives selection problem
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Robust approach to restricted items selection problem
