A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
From MaRDI portal
Publication:1628068
DOI10.1016/J.COR.2018.08.004zbMATH Open1458.90573OpenAlexW2885892355WikidataQ129414537 ScholiaQ129414537MaRDI QIDQ1628068FDOQ1628068
Authors: Payman Ghasemi Saghand, Hadi Charkhgard, Changhyun Kwon 
Publication date: 3 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.08.004
Recommendations
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Branch-and-bound for bi-objective integer programming
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
branch-and-bound algorithmlinear programmingmulti-objective optimizationoptimization over the efficient setmultiplicative programming
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Mixed-integer nonlinear optimization
- Benchmarking optimization software with performance profiles.
- An Algorithm for the Traveling Salesman Problem
- An Automatic Method of Solving Discrete Programming Problems
- Geometric algorithms and combinatorial optimization
- The bargaining problem
- Multicriteria Optimization
- Two-Person Cooperative Games
- Branching rules revisited
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Title not available (Why is that?)
- On Polyhedral Approximations of the Second-Order Cone
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Global optimization of multiplicative programs
- Optimization over the efficient set
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Finding all nondominated points of multi-objective integer programs
- Bicriteria Transportation Problem
- Bound sets for biobjective combinatorial optimization problems
- An exact algorithm for biobjective mixed integer linear programming problems
- An algorithm for optimizing a linear function over an integer efficient set
- On finding representative non-dominated points for bi-objective integer network flow problems
- Experiments in mixed-integer linear programming
- Solving large MINLPs on computational grids
- An outcome-space finite algorithm for solving linear multiplicative programming
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
- Multi-objective branch and bound
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- An objective space cut and bound algorithm for convex multiplicative programmes
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games
Cited In (17)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- Solving multiplicative programs by binary-encoding the multiplication operation
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- The magic of Nash social welfare in optimization: do not sum, just multiply!
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
- An exact criterion space search algorithm for a bi-objective blood collection problem
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Solving multiobjective mixed integer convex optimization problems
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
Uses Software
This page was built for publication: A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628068)
