Pages that link to "Item:Q545544"

The following pages link to A branch-and-bound algorithm for hard multiple knapsack problems (Q545544):

Displaying 18 items.

• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems (Q733985) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Solutions of hard knapsack problems using extreme pruning (Q1624979) (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem (Q3354470) (← links)
• (Q4387182) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
• A study of lattice reformulations for integer programming (Q6047692) (← links)