Pages that link to "Item:Q2466588"

The following pages link to An optimization algorithm for a penalized knapsack problem (Q2466588):

Displaying 11 items.

• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• New dynamic programming algorithms for the resource constrained elementary shortest path problem (Q3507646) (← 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)