A simplex social spider algorithm for solving integer programming and minimax problems.
Mohamed A. TawhidAhmed Fouad AliPublished in: Memetic Comput. (2016)
Keyphrases
- integer programming
- np hard
- integer program
- transportation problem
- lp relaxation
- linear programming
- worst case
- combinatorial optimization
- network flow
- benchmark problems
- linear programming problems
- simplex method
- set covering
- dynamic programming
- learning algorithm
- set covering problem
- search space
- heuristic methods
- lagrangian relaxation
- optimization problems
- integer programming formulations
- cutting plane algorithm
- simplex algorithm
- valid inequalities
- game tree
- knapsack problem
- convex hull
- optimal solution