Approximation of linear fractional-multiplicative problems
From MaRDI portal
Recommendations
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
- A FPTAS for a class of linear multiplicative problems
- A polynomial time approximation algorithm for linear fractional programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programming problems
- scientific article; zbMATH DE number 7109241
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 757680 (Why is no real title available?)
- A FPTAS for a class of linear multiplicative problems
- Approximation of linear fractional-multiplicative problems
- Fractional programming
- Fractional programming: The sum-of-ratios case
- Quadratic programming and combinatorial minimum weight product problems
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(28)- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- scientific article; zbMATH DE number 1594561 (Why is no real title available?)
- On different approximation criteria for subset product problems
- Approximating a class of combinatorial problems with rational objective function
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A potential practical algorithm for minimizing the sum of affine fractional functions
- (Global) optimization: historical notes and recent developments
- Approximation of linear fractional-multiplicative problems
- Linear decomposition approach for a class of nonconvex programming problems
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- Approximation algorithm for a class of global optimization problems
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programming problems
- Efficient local search procedures for quadratic fractional programming problems
- On the approximation of real rational functions via mixed-integer linear programming
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- scientific article; zbMATH DE number 3976806 (Why is no real title available?)
- A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
- On the approximation of fractional resolution families
- Approximating Rational Objectives Is as Easy as Approximating Linear Ones
- An effective computational algorithm for the global solution of a class of linear fractional programming
- Approximation of semilinear fractional Cauchy problem
- A FPTAS for a class of linear multiplicative problems
- An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
This page was built for publication: Approximation of linear fractional-multiplicative problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543418)
