Finding optimal Bayesian networks using precedence constraints.
Pekka ParviainenMikko KoivistoPublished in: J. Mach. Learn. Res. (2013)
Keyphrases
- finding optimal
- precedence constraints
- bayesian networks
- scheduling problem
- branch and bound algorithm
- vertex cover
- parallel machines
- precedence relations
- approximation algorithms
- partial order
- release dates
- parallel processors
- partially ordered
- single machine scheduling problem
- maximum lateness
- np hard
- global constraints
- optimal or near optimal
- probabilistic model
- graphical models
- unit length
- partially ordered sets
- upper bound
- lower bound
- branch and bound
- optimal strategy
- processing times
- single machine
- random variables