Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
From MaRDI portal
Publication:1634058
DOI10.1016/j.cor.2018.10.014zbMath1458.90280OpenAlexW2896660071MaRDI QIDQ1634058
Publication date: 17 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.014
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (3)
Robust optimization strategies for seller based on uncertainty sets in context of sequential auction ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Combinatorial optimization problems with balanced regret
Cites Work
- Robust multi-market newsvendor models with interval demand data
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Single machine scheduling with resource dependent release times and processing times
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Minmax regret combinatorial optimization problems with investments
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Robust scheduling on a single machine to minimize total flow time
- Project scheduling under uncertainty: survey and research potentials
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- A survey of scheduling with controllable processing times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A novel approach to bilevel nonlinear programming
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Unnamed Item
This page was built for publication: Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
