A decentralized heuristic for multiple-choice combinatorial optimization problems

DOI10.1007/978-3-319-00795-3_43MaRDI QIDQ5171816zbMATH OpenOpenAlexFDO

Authors Christian Hinrichs, Sebastian Lehnhoff, Michael Sonnenschein

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

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

Recommendations

• A class of algorithms for distributed constraint optimization.
• Probabilistic optimal solution assessment for DCOPs
• Distributed constraint optimization problems and applications: a survey
• A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
• Decentralized multi-agent optimization based on a penalty method

Cites work

• A minimal algorithm for the multiple-choice knapsack problem
• Exploring complex networks
• Hard multidimensional multiple choice knapsack problems, an empirical study
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Metaheuristics. From design to implementation.
• The multiobjective multidimensional knapsack problem: a survey and a new approach

Cited in

(2)

• A decentralized multi-objective optimization algorithm
• Decentralized Cooperative Optimization for Multi-criteria Decision Making

This page was built for publication: A decentralized heuristic for multiple-choice combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171816)