Continuous Relaxation of MINLP Problems by Penalty Functions: A Practical Comparison.
M. Fernanda P. CostaAna Maria A. C. RochaEdite M. G. P. FernandesPublished in: ICCSA (3) (2017)
Keyphrases
- continuous relaxation
- mixed integer
- penalty functions
- knapsack problem
- higher dimensional
- quadratic program
- optimization problems
- network design problem
- linear program
- multidimensional knapsack problem
- linear programming
- feasible solution
- lot sizing
- mathematical programming
- mixed integer linear programming
- estimation problems
- continuous variables
- feature selection
- convex hull
- scheduling problem
- special case
- optimal solution
- objective function
- bayesian networks