A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
zbMATH Open document ID: 1458.90573
author: Payman Ghasemi Saghand
author: Hadi Charkhgard
author: Changhyun Kwon
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6988109
zbMATH Keywords: multiplicative programming
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: optimization over the efficient set
zbMATH Keywords: linear programming
zbMATH Keywords: branch-and-bound algorithm
describes a project that uses: MOIP_AIRA
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2018.08.004
OpenAlex ID: W2885892355
cites work: Branching rules revisited
cites work: Bicriteria Transportation Problem
cites work: Mixed-integer nonlinear optimization
cites work: On Polyhedral Approximations of the Second-Order Cone
cites work: Experiments in mixed-integer linear programming
cites work: Optimization over the efficient set
cites work: A new method for optimizing a linear function over the efficient set of a multiobjective integer program
cites work: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
cites work: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
cites work: Benchmarking optimization software with performance profiles.
cites work: Multicriteria Optimization
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: Consensus of Subjective Probabilities: The Pari-Mutuel Method
cites work: On finding representative non-dominated points for bi-objective integer network flow problems
cites work: An outcome-space finite algorithm for solving linear multiplicative programming
cites work: Solving large MINLPs on computational grids
cites work: Geometric algorithms and combinatorial optimization
cites work: Q3549634
cites work: An algorithm for optimizing a linear function over an integer efficient set
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Finding all nondominated points of multi-objective integer programs
cites work: The Bargaining Problem
cites work: Two-Person Cooperative Games
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: Multi-objective branch and bound
cites work: Global optimization of multiplicative programs
cites work: An objective space cut and bound algorithm for convex multiplicative programmes
cites work: Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
cites work: An exact algorithm for biobjective mixed integer linear programming problems
cites work: The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
cites work: Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
Wikidata QID: Q129414537
DOI: 10.1016/J.COR.2018.08.004
description: scientific article; zbMATH DE number 6988109