Pages that link to "Item:Q1755383"

The following pages link to Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383):

Displaying 19 items.

• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Half-cycle: a new formulation for modelling kidney exchange problems (Q6106526) (← links)
• One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
• Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints (Q6551087) (← links)
• A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem (Q6595340) (← links)