Finding a feasible solution for a class of distributed problems with a single sum constraint using agents
In this paper, we describe a Multi-Agent System which is capable of finding a feasible solution of a class of distributed problems, in which the subproblems share a single a sum constraint. Emphasis is given to correctness issues and termination detection.
|Keywords||distributed problems, multi-agent system|
|Persistent URL||dx.doi.org/1022336001999, hdl.handle.net/1765/14408|
de Bruin, A., Kindervater, G.A.P., Vredeveld, T., & Wagelmans, A.P.M.. (2003). Finding a feasible solution for a class of distributed problems with a single sum constraint using agents. Constraints, 209–218. doi:1022336001999