Pages that link to "Item:Q1272984"
From MaRDI portal
The following pages link to Cutting plane/tabu search algorithms for low rank concave quadratic programming problems (Q1272984):
Displaying 7 items.
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- Cutting Planes for Low-Rank-Like Concave Minimization Problems (Q5322008) (← links)
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)
- A normal fan projection algorithm for low-rank optimization (Q6665394) (← links)