A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs : a bi-objective optimization approach
Year of publication: |
January 2019
|
---|---|
Authors: | Saghand, Payman Ghasemi ; Charkhgard, Hadi ; Kwon, Changhyun |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 101.2019, p. 263-274
|
Subject: | Multiplicative programming | Multi-objective optimization | Optimization over the efficient set | Linear programming | Branch-and-bound algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Algorithmus | Algorithm |
-
Barketau, M., (2013)
-
Mahmoodian, Vahid, (2021)
-
Belhoul, Lyes, (2014)
- More ...
-
Solving multiplicative programs by binary-encoding the multiplication operation
Saghand, Payman Ghasemi, (2023)
-
Saghand, Payman Ghasemi, (2022)
-
Saghand, Payman Ghasemi, (2022)
- More ...