Pages that link to "Item:Q4834075"

The following pages link to Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms (Q4834075):

Displaying 11 items.

• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions (Q5391895) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
• An efficient algorithm to allocate shelf space (Q5937352) (← links)