Forward bounding on pseudo-trees for DCOPs and ADCOPs
type: Item
instance of: scholarly article
title: Forward bounding on pseudo-trees for DCOPs and ADCOPs
zbMATH Open document ID: 1419.68097
author: Omer Litov
author: Amnon Meisels
published in: Artificial Intelligence
publication date: 2017-11-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6810473
zbMATH Keywords: distributed constraints optimization
zbMATH Keywords: asymmetric DCOPs
MaRDI profile type: Publication
full work available at URL: j.artint.2017.07.003
OpenAlex ID: W2755744147
cites work: BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
cites work: Q3624176
cites work: Concurrent forward bounding for distributed constraint optimization problems
cites work: Asynchronous forward-checking for DisCSPs
cites work: Asymmetric distributed constraint optimization problems
cites work: Adopt: asynchronous distributed constraint optimization with quality guarantees
cites work: Concurrent search for distributed CSPs
cites work: Message delay and DisCSP search algorithms
cites work: Distributed constraint satisfaction with partially known constraints
DOI: 10.1016/J.ARTINT.2017.07.003
Recommended article: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Recommended article: Approximation Algorithms for Generalized Bounded Tree Cover
Recommended article: CSP duality and trees of bounded pathwidth
Recommended article: Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
Recommended article: Q3795218
Recommended article: Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
Recommended article: New limits of treewidth-based tractability in optimization
description: scientific article; zbMATH DE number 6810473