A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems

DOI10.1007/978-3-319-00795-3_43zbMath1305.90352OpenAlexW204058792MaRDI QIDQ5171816

Sebastian Lehnhoff, Michael Sonnenschein, Christian Hinrichs

Publication date: 12 February 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-00795-3_43

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Hard multidimensional multiple choice knapsack problems, an empirical study
• A minimal algorithm for the multiple-choice knapsack problem
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Exploring complex networks

This page was built for publication: A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems