Pages that link to "Item:Q1683128"
From MaRDI portal
The following pages link to A double oracle approach to minmax regret optimization problems with interval data (Q1683128):
Displaying 8 items.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- The impacts of retailers' regret aversion on a random multi-period supply chain network (Q2086940) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- Competitive difference analysis of the cash management problem with uncertain demands (Q2294663) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- A discrete dynamics approach to sparse calculation and applied in ontology science (Q5205890) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
