Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
From MaRDI portal
Publication:2669645
Recommendations
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
Cites work
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A logic-based axiomatic model of bargaining
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- An algorithm for optimizing a linear function over an integer efficient set
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- An objective space cut and bound algorithm for convex multiplicative programmes
- An outcome-space finite algorithm for solving linear multiplicative programming
- Approximating multiobjective knapsack problems
- Approximating the Nash social welfare with indivisible items
- Benchmarking optimization software with performance profiles.
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Decision Support for a Housing Mobility Program Using a Multiobjective Optimization Model
- Error detecting and error correcting codes
- Game theory approach for multiobjective structural optimization
- Geometric algorithms and combinatorial optimization
- Global optimization of multiplicative programs
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- scientific article; zbMATH DE number 5485471 (Why is no real title available?)
- Interactive Coordination of Objective Decompositions in Multiobjective Programming
- Local branching
- Maximizing Nash product social welfare in allocating indivisible goods
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Multicriteria Optimization
- Multiple criteria decision making, multiattribute utility theory: recent accomplishments and what lies ahead
- Nonsymmetric Nash solutions and replications of 2-person bargaining
- On Polyhedral Approximations of the Second-Order Cone
- Optimization over the efficient set
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- 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
- The bargaining problem
- The bargaining problem without convexity. Extending the egalitarian and Kalai-Smorodinsky solutions
- The feasibility pump
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- The Nash Social Welfare Function
- Two-Person Cooperative Games
Cited in
(8)- A nonisolated optimal solution of general linear multiplicative programming problems
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- The magic of Nash social welfare in optimization: do not sum, just multiply!
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- Solving multiplicative programs by binary-encoding the multiplication operation
- A criterion space search feasibility pump heuristic for solving maximum multiplicative programs
- Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs
This page was built for publication: Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669645)
