Secure Combinatorial Optimization Simulating DFS Tree-Based Variable Elimination.
Marius-Calin SilaghiBoi FaltingsAdrian PetcuPublished in: AI&M (2006)
Keyphrases
- combinatorial optimization
- variable elimination
- inference in bayesian networks
- probabilistic inference
- bayesian networks
- branch and bound
- metaheuristic
- traveling salesman problem
- combinatorial optimization problems
- depth first search
- belief networks
- combinatorial problems
- optimization problems
- branch and bound algorithm
- mathematical programming
- vehicle routing problem
- simulated annealing
- graphical models
- hard combinatorial optimization problems
- constraint databases
- cost function
- multi objective
- artificial neural networks