Solving linear multiplicative programs via branch-and-bound: a computational experience.
Riccardo CambiniRossana RiccardiDomenico ScopellitiPublished in: Comput. Manag. Sci. (2023)
Keyphrases
- branch and bound
- branch and bound procedure
- combinatorial optimization
- integer programming problems
- lower bound
- branch and bound algorithm
- branch and bound search
- column generation
- search algorithm
- cutting plane
- upper bound
- optimal solution
- search space
- mathematical programming
- partial solutions
- bnb adopt
- implicit enumeration
- branch and bound method
- randomly generated problems
- beam search
- tree search algorithm
- integer program
- lagrangian heuristic
- tree search
- metaheuristic
- artificial bee colony algorithm
- network design problem
- max sat
- search strategies
- linear programming relaxation
- previously solved
- simulated annealing
- state space