The following pages link to (Q4831691):
Displaying 10 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- Variational algorithms for biclustering models (Q1663249) (← links)
- Well-posedness and primal-dual analysis of some convex separable optimization problems (Q1953228) (← links)
- A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Model-based clustering of large networks (Q2443165) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
