Concurrent forward bounding for distributed constraint optimization problems
From MaRDI portal
Publication:359999
DOI10.1016/J.ARTINT.2012.09.002zbMATH Open1270.68275OpenAlexW2035931740MaRDI QIDQ359999FDOQ359999
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
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- AND/OR search spaces for graphical models
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
Cited In (8)
- Title not available (Why is that?)
- Probabilistic optimal solution assessment for DCOPs
- Boosting Distributed Constraint Satisfaction
- Communication-Aware Local Search for Distributed Constraint Optimization
- Asynchronous breadth-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)
