Search Results - subject:"Multiplicative programming"

A criterion space search algorithm for mixed integer linear maximum multiplicative programs : a multiobjective optimization approach

Saghand, Payman Ghasemi; Charkhgard, Hadi - In: International transactions in operational research : a … 29 (2022) 3, pp. 1659-1687

Persistent link: https://www.econbiz.de/10012795875

Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization

Saghand, Payman Ghasemi; Charkhgard, Hadi - In: Computers & operations research : and their … 137 (2022), pp. 1-17

Persistent link: https://www.econbiz.de/10013197423

A criterion space branch-and-cut algorithm for mixed integer bilinear maximum multiplicative programs

Mahmoodian, Vahid; Dayarian, Iman; Saghand, Payman Ghasemi - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 3, pp. 1453-1470

Persistent link: https://www.econbiz.de/10013361681

Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs

Mahmoodian, Vahid; Charkhgard, Hadi; Zhang, Yu - In: Computers & operations research : and their … 128 (2021), pp. 1-14

Persistent link: https://www.econbiz.de/10012439866

A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs : a bi-objective optimization approach

Saghand, Payman Ghasemi; Charkhgard, Hadi; Kwon, Changhyun - In: Computers & operations research : and their … 101 (2019), pp. 263-274

Persistent link: https://www.econbiz.de/10011947958

Robust network design with uncertain outsourcing cost

Pessoa, Artur; Poss, Michael - In: INFORMS journal on computing : JOC 27 (2015) 3, pp. 507-524

Persistent link: https://www.econbiz.de/10011387567

An objective space cut and bound algorithm for convex multiplicative programmes

Shao, Lizhen; Ehrgott, Matthias - In: Journal of Global Optimization 58 (2014) 4, pp. 711-728

Multiplicative programming problems are global optimisation problems known to be NP-hard. In this paper we propose an … objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is …-objective optimisation algorithm can be changed into a cut and bound algorithm to solve convex multiplicative programming problems. We use an …

Persistent link: https://www.econbiz.de/10010896433

An outcome space approach for generalized convex multiplicative programs

Oliveira, Rúbia; Ferreira, Paulo - In: Journal of Global Optimization 47 (2010) 1, pp. 107-118

Persistent link: https://www.econbiz.de/10008515431

A FPTAS for a class of linear multiplicative problems

Depetrini, Daniele; Locatelli, Marco - In: Computational Optimization and Applications 44 (2009) 2, pp. 275-288

Persistent link: https://www.econbiz.de/10008467085