A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach

Open Webpage

Payman Ghasemi Saghand, Hadi Charkhgard, Changhyun Kwon

Published: 2019, Last Modified: 11 Feb 2025Comput. Oper. Res. 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We study a class of mixed integer non-linear optimization problems.•We develop a novel branch-and-bound algorithm.•We show that the proposed algorithm outperforms a standard solver.