Forward bounding on pseudo-trees for DCOPs and ADCOPs

DOI10.1016/j.artint.2017.07.003zbMath1419.68097OpenAlexW2755744147MaRDI QIDQ1677435

Amnon Meisels, Omer Litov

Publication date: 21 November 2017

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2017.07.003

zbMATH Keywords

asymmetric DCOPsdistributed constraints optimization

Mathematics Subject Classification ID

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

Related Items (2)

Incentive-based search for equilibria in Boolean games ⋮ A dual-population search differential evolution algorithm for functional distributed constraint optimization problems

Cites Work

• Unnamed Item
• Concurrent forward bounding for distributed constraint optimization problems
• Distributed constraint satisfaction with partially known constraints
• Message delay and DisCSP search algorithms
• Asynchronous forward-checking for DisCSPs
• Concurrent search for distributed CSPs
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Asymmetric Distributed Constraint Optimization Problems
• BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm

This page was built for publication: Forward bounding on pseudo-trees for DCOPs and ADCOPs