Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions

DOI10.1007/978-3-540-77903-2_24zbMath1209.90305OpenAlexW2585345288MaRDI QIDQ5391895

Jella Pfeiffer, Franz Rothlauf

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_24

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A genetic algorithm for the multidimensional knapsack problem
• Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions