A branch-and-bound algorithm with growing datasets for large-scale parameter estimation.
Susanne SassAlexander MitsosDominik BongartzIan H. BellNikolay I. NikolovAngelos TsoukalasPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- parameter estimation
- branch and bound algorithm
- branch and bound
- lower bound
- maximum likelihood
- upper bound
- least squares
- optimal solution
- model selection
- em algorithm
- np hard
- markov random field
- lower bounding
- precedence constraints
- combinatorial optimization
- parameter estimation algorithm
- single machine scheduling problem
- expectation maximization
- randomly generated problems
- random fields
- mixed integer linear programming
- lagrangian relaxation
- model fitting
- upper bounding
- finding an optimal solution
- parameter estimates
- estimation problems
- structure learning
- maximum clique
- image segmentation
- search algorithm
- computational complexity
- probabilistic model
- max sat
- scheduling problem
- evolutionary algorithm
- special case
- markov chain
- multi objective