A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach. - Payman Ghasemi Saghand; Hadi Charkhgard; Changhyun Kwon 001 (Comput. Oper. Res., 2019)

Maximum Multiplicative Programming: Theory, Algorithms, and Applications. - Payman Ghasemi Saghand (2021)

Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization. - Payman Ghasemi Saghand; Hadi Charkhgard (Comput. Oper. Res., 2022)

A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs. - Vahid Mahmoodian; Iman Dayarian; Payman Ghasemi Saghand; Yu Zhang; Hadi Charkhgard (INFORMS J. Comput., 2022)

A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach. - Payman Ghasemi Saghand; Hadi Charkhgard (Int. Trans. Oper. Res., 2022)

Solving multiplicative programs by binary-encoding the multiplication operation. - Payman Ghasemi Saghand; Fabian Rigterink; Vahid Mahmoodian; Hadi Charkhgard (Comput. Oper. Res., 2023)