Pages that link to "Item:Q3991501"
From MaRDI portal
The following pages link to NP-hard problems and test problems for global concave minimization methods (Q3991501):
Displaying 6 items.
- Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
- A generalization of the construction of test problems for nonconvex optimization (Q1330804) (← links)
- On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)