Pages that link to "Item:Q1165155"
From MaRDI portal
The following pages link to Relationship between bilinear programming and concave minimization under linear constraints (Q1165155):
Displaying 10 items.
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications (Q1112727) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- Finite method of minimizing a concave function under linear constraints and applications (Q3030588) (← links)
