A heuristic method to find a quick feasible solution based on the ratio programming.
M. N. YarahmadiS. A. MirHassaniFarnaz HooshmandPublished in: Oper. Res. (2023)
Keyphrases
- feasible solution
- cost function
- objective function
- dynamic programming
- linear programming
- branch and bound method
- mathematical model
- search space
- optimal solution
- search algorithm
- simulated annealing
- face recognition
- tabu search
- decision trees
- combinatorial optimization
- genetic algorithm
- search procedure
- heuristic solution
- neural network