Pages that link to "Item:Q1634770"
From MaRDI portal
The following pages link to New exact approaches and approximation results for the penalized knapsack problem (Q1634770):
Displaying 12 items.
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← 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)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)