Pages that link to "Item:Q3524431"

The following pages link to A survey of effective heuristics and their application to a variety of knapsack problems (Q3524431):

Displaying 21 items.

• A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
• An application of the multiple knapsack problem: the self-sufficient marine (Q1752270) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• Large-scale multi-period precedence constrained knapsack problem: a mining application (Q2883587) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
• Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)