scientific article; zbMATH DE number 2124285
From MaRDI portal
Publication:4831691
DOI10.1155/S168712000402009XzbMath1141.90497OpenAlexW2168735742MaRDI QIDQ4831691
Publication date: 3 January 2005
Published in: Applied Mathematics Research eXpress (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/s168712000402009x
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Variational algorithms for biclustering models ⋮ Convex programming with single separable constraint and bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ A Newton-type algorithm for solving problems of search theory ⋮ Model-based clustering of large networks ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Solution of some convex separable resource allocation and production planning problems with bounds on the variables ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem
This page was built for publication:
