Pages that link to "Item:Q1949686"
From MaRDI portal
The following pages link to An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set (Q1949686):
Displayed 11 items.
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- Pricing Toll Roads under Uncertainty (Q5240222) (← links)
- A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing (Q5506759) (← links)
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)