An interior-point Benders based branch-and-cut algorithm for mixed integer programs.
Joe Naoum-SawayaSamir ElhedhliPublished in: Ann. Oper. Res. (2013)
Keyphrases
- linear programming
- dynamic programming
- decomposition algorithm
- computational complexity
- expectation maximization
- interior point
- learning algorithm
- simulated annealing
- primal dual
- np hard
- k means
- optimal solution
- objective function
- image segmentation
- search space
- ant colony optimization
- combinatorial optimization
- convex hull
- feasible solution