Pages that link to "Item:Q322574"
From MaRDI portal
The following pages link to Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574):
Displaying 7 items.
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure (Q1652171) (← links)
- Retail store operations: literature review and research directions (Q1681258) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- Assortment planning for multiple chain stores (Q2319385) (← links)
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems (Q6052645) (← links)
- Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery (Q6082267) (← links)