A branch and bound technique for finding the minimal solutions of the linear optimization problems subjected to Lukasiewicz.
Amin GhodousianZahra BoreiriFaeze HabibiPublished in: CoRR (2022)
Keyphrases
- branch and bound
- optimal solution
- optimization problems
- combinatorial optimization
- lower bound
- branch and bound algorithm
- search algorithm
- partial solutions
- metaheuristic
- search space
- objective function
- benchmark problems
- previously solved
- upper bound
- column generation
- evolutionary algorithm
- branch and bound method
- lagrangian heuristic
- randomly generated problems
- feasible solution
- cost function
- traveling salesman problem
- tree search
- network design problem
- branch and bound procedure
- optimization criteria
- beam search
- np hard
- knapsack problem
- depth first search
- branch and bound search
- tree search algorithm
- linear programming relaxation
- max sat
- integer programming problems
- modal logic
- ant colony optimization
- linear programming
- sat problem