A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization.
Adrian PetcuBoi FaltingsPublished in: IAT (2007)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- traveling salesman problem
- branch and bound
- combinatorial problems
- mathematical programming
- optimization problems
- distributed systems
- branch and bound algorithm
- memetic algorithm
- quadratic assignment problem
- hard combinatorial optimization problems
- vehicle routing problem
- bayesian networks
- exact algorithms
- peer to peer
- genetic algorithm
- combinatorial search
- single machine scheduling problem
- path relinking
- max flow min cut
- artificial bee colony
- job shop scheduling problem
- graph theory
- pairwise