Pages that link to "Item:Q968116"

The following pages link to A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116):

Displaying 30 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• Generalized resolution search (Q429682) (← links)
• Capacity allocation problem with random demands for the rail container carrier (Q439359) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
• A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← 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)
• A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem (Q2798113) (← links)
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)