An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
From MaRDI portal
Publication:1949686
Recommendations
- An FPTAS for optimizing a class of low-rank functions over a polytope
- An FPTAS for minimizing the product of two non-negative linear cost functions
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- A FPTAS for a class of linear multiplicative problems
- On minimizing the sum of a convex function and a concave function
Cited in
(14)- Fractional 0-1 programming: applications and algorithms
- A faster FPTAS for a supply chain scheduling problem to minimize holding costs with outsourcing
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Linear decomposition approach for a class of nonconvex programming problems
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A PTAS for a class of binary non-linear programs with low-rank functions
- Pricing Toll Roads under Uncertainty
- An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
- A normal fan projection algorithm for low-rank optimization
- An FPTAS for optimizing a class of low-rank functions over a polytope
- A class of exponential neighbourhoods for the quadratic travelling salesman problem
- An FPTAS for minimizing the product of two non-negative linear cost functions
This page was built for publication: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949686)