Pages that link to "Item:Q337391"
From MaRDI portal
The following pages link to The robust knapsack problem with queries (Q337391):
Displaying 12 items.
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- (Q4993294) (← links)
- Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
