Approximation of linear fractional-multiplicative problems
From MaRDI portal
Publication:543418
DOI10.1007/S10107-009-0309-2zbMATH Open1218.90160OpenAlexW2061085256MaRDI QIDQ543418FDOQ543418
Marco Locatelli, Daniele Depetrini
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0309-2
Fractional programming (90C32) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractional programming: The sum-of-ratios case
- Fractional programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Quadratic programming and combinatorial minimum weight product problems
- Approximation of linear fractional-multiplicative problems
- A FPTAS for a class of linear multiplicative problems
Cited In (22)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Efficient local search procedures for quadratic fractional programming problems
- Title not available (Why is that?)
- An effective computational algorithm for the global solution of a class of linear fractional programming
- Title not available (Why is that?)
- Approximation of semilinear fractional Cauchy problem
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Title not available (Why is that?)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- Linear decomposition approach for a class of nonconvex programming problems
- A potential practical algorithm for minimizing the sum of affine fractional functions
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- On the approximation of fractional resolution families
- Approximation of linear fractional-multiplicative problems
- Title not available (Why is that?)
- On the approximation of real rational functions via mixed-integer linear programming
- (Global) optimization: historical notes and recent developments
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Approximation algorithm for a class of global optimization 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)