Concurrent forward bounding for distributed constraint optimization problems

DOI10.1016/J.ARTINT.2012.09.002MaRDI QIDQ359999zbMATH OpenOpenAlexFDO

Authors Arnon Netzer, Alon Grubshtein, Amnon Meisels

Publication date 23 August 2013

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0004370212001087

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• Distributed constraint optimization problems and applications: a survey
• Distributed Abstract Optimization via Constraints Consensus: Theory and Applications
• Distributed algorithms for convex problems with linear coupling constraints
• An algorithm for distributed constraint optimization problems with low constraint density
• A class of algorithms for distributed constraint optimization.
• scientific article; zbMATH DE number 1975621
• Distributed Optimization With Coupling Constraints

Cites work

• scientific article; zbMATH DE number 1573293 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• A CSP search algorithm with responsibility sets and kernels
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• AND/OR search spaces for graphical models
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Approximations in Distributed Optimization
• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Completeness and performance of the APO algorithm
• Concurrent search for distributed CSPs
• Distributed constraint satisfaction with partially known constraints
• Distributed search by constrained agents. Algorithms, performance, communication.
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms
• Min-domain retroactive ordering for asynchronous backtracking
• Removing redundant messages in n-ary BnB-ADOPT
• The distributed breakout algorithms

Cited in

(13)

• scientific article; zbMATH DE number 5547971 (Why is no real title available?)
• Concurrent search for distributed CSPs
• Probabilistic optimal solution assessment for DCOPs
• Boosting Distributed Constraint Satisfaction
• Decentralized, decomposition-based observation scheduling for a large-scale satellite constellation
• Principles and Practice of Constraint Programming – CP 2004
• Communication-Aware Local Search for Distributed Constraint Optimization
• Asynchronous breadth-first search DCOP algorithm
• An improved distributed constraint optimization algorithm \(\text{MULBS}^+\)
• IDB-ADOPT: A Depth-First Search DCOP Algorithm
• Forward bounding on pseudo-trees for DCOPs and ADCOPs
• Incentive-based search for equilibria in Boolean games
• On parallel partial solutions and approximation schemes for local consistency in networks of constraints

This page was built for publication: Concurrent forward bounding for distributed constraint optimization problems

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