Concurrent forward bounding for distributed constraint optimization problems

DOI10.1016/j.artint.2012.09.002zbMath1270.68275OpenAlexW2035931740MaRDI QIDQ359999

Amnon Meisels, Alon Grubshtein, Arnon Netzer

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)

Related Items (4)

Forward bounding on pseudo-trees for DCOPs and ADCOPs ⋮ Incentive-based search for equilibria in Boolean games ⋮ Probabilistic optimal solution assessment for DCOPs ⋮ Communication-Aware Local Search for Distributed Constraint Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-domain retroactive ordering for asynchronous backtracking
• Distributed constraint satisfaction with partially known constraints
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms
• AND/OR search spaces for graphical models
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Distributed search by constrained agents. Algorithms, performance, communication.
• A CSP search algorithm with responsibility sets and kernels
• Concurrent search for distributed CSPs
• The distributed breakout algorithms
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Removing Redundant Messages in N-ary BnB-ADOPT
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Approximations in Distributed Optimization
• BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm

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