Pages that link to "Item:Q687097"
From MaRDI portal
The following pages link to Open questions in complexity theory for numerical optimization (Q687097):
Displayed 5 items.
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)