The search-and-remove algorithm for biobjective mixed-integer linear programming problems.
Banu SoyluPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- linear programming problems
- mixed integer
- linear programming
- primal dual
- multiple objectives
- optimal solution
- linear program
- computational complexity
- convex hull
- search space
- dynamic programming
- worst case
- np hard
- cost function
- column generation
- bi objective
- feasible solution
- multi objective
- simulated annealing
- probabilistic model
- expectation maximization
- optimization algorithm
- lot sizing
- feature space