A recombination-based matheuristic for mixed integer programming problems with binary variables.
André L. MaravilhaEduardo G. CarranoFelipe CampeloPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- mixed integer programming problems
- binary variables
- random variables
- knapsack problem
- mixed integer programming
- linear program
- piecewise linear
- limited memory
- energy function
- continuous variables
- linear constraints
- linear programming relaxation
- problems in computer vision
- np hard
- convex functions
- mixed integer
- lot sizing
- computer vision
- linear programming
- graphical models
- pose estimation
- dynamic programming
- valid inequalities
- column generation
- routing problem
- influence diagrams
- multistage
- evolutionary algorithm
- objective function
- bayesian networks