Pages that link to "Item:Q3120586"
From MaRDI portal
The following pages link to The knapsack problem with a minimum filling constraint (Q3120586):
Displaying 11 items.
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Optimal pricing policy design for selling cost-reducing innovation in Cournot games (Q2067618) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- The knapsack problem with forfeits (Q2225068) (← links)
- The 1-Neighbour Knapsack Problem (Q3111641) (← links)
- (Q3138272) (← links)
- A Knapsack Secretary Problem with Applications (Q3603454) (← links)
- Minmax linear knapsack problem with grouped variables and gub (Q3835625) (← links)
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)