A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem.
Marco A. BoschettiVittorio ManiezzoMatteo RoffilliPublished in: INFORMS J. Comput. (2011)
Keyphrases
- network design problem
- fully distributed
- network design
- branch and bound
- approximation algorithms
- mixed integer
- integer programming
- mixed integer programming
- lagrangian relaxation
- transportation networks
- minimal cost
- cooperative
- optimal solution
- valid inequalities
- exact solution
- feasible solution
- column generation
- peer to peer
- lower bound
- multi agent systems
- network architecture
- loosely coupled
- traveling salesman problem
- cutting plane
- search algorithm
- bayesian networks