Pages that link to "Item:Q1652189"
From MaRDI portal
The following pages link to An exact approach for the 0-1 knapsack problem with setups (Q1652189):
Displaying 19 items.
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- An exact algorithm for the Knapsack problem with setup (Q840596) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← links)
- (Q3570781) (← links)
- (Q4535156) (← links)
- Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123) (← links)
- (Q5240419) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
