Pages that link to "Item:Q5307529"
From MaRDI portal
The following pages link to An Incremental Model for Combinatorial Maximization Problems (Q5307529):
Displaying 8 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- Comparison of the genetic algorithm and incremental optimisation routines for a Bayesian inverse modelling based network design (Q4569351) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
