Login / Signup
Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems.
Ville-Pekka Eronen
Jan Kronqvist
Tapio Westerlund
Marko M. Mäkelä
Napsu Karmitsa
Published in:
J. Glob. Optim. (2017)
Keyphrases
</>
mixed integer
nonlinear programming problems
optimal solution
cost function
combinatorial optimization
continuous variables
objective function
search algorithm
markov random field
em algorithm
linear program
sensitivity analysis
convex optimization