A Continuous Relaxation for Discrete Bayesian Optimization.
Richard MichaelSimon BartelsMiguel González DuqueYevgen ZainchkovskyyJes FrellsenSøren HaubergWouter BoomsmaPublished in: CoRR (2024)
Keyphrases
- continuous relaxation
- knapsack problem
- quadratic program
- mixed integer
- higher dimensional
- optimization problems
- linear programming
- optimization algorithm
- bayesian networks
- feasible solution
- upper bound
- multidimensional knapsack problem
- linear program
- convex optimization
- linear constraints
- quadratic programming
- constrained optimization
- distance transform
- lot sizing
- finite number
- bayesian inference
- approximation algorithms
- maximum likelihood
- objective function