Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms.
Balázs BánhelyiMarco BiazziniAlberto MontresorMárk JelasityPublished in: EvoWorkshops (2009)
Keyphrases
- branch and bound
- combinatorial optimization
- peer to peer
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- optimal solution
- peer to peer networks
- upper bound
- column generation
- tree search
- beam search
- branch and bound procedure
- randomly generated problems
- branch and bound method
- mini bucket
- depth first search
- simulated annealing
- optimization problems
- branch and bound search
- network design problem
- file sharing
- genetic algorithm
- digital libraries
- linear programming relaxation
- particle swarm optimization
- mathematical programming
- constraint satisfaction problems
- optimization algorithm
- metaheuristic
- constraint satisfaction
- linear program
- tree search algorithm
- traveling salesman problem