Complexity and algorithms for convex network optimization and other nonlinear problems

DOI10.1007/s10288-005-0078-6zbMath1099.90059OpenAlexW2093840087MaRDI QIDQ816571

Dorit S. Hochbaum

Publication date: 9 March 2006

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-005-0078-6

zbMATH Keywords

Nonlinear optimizationstrongly polynomial algorithmsconvex network flowlower bounds on complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30)

Related Items

Optimal deterministic and robust selection of electricity contracts ⋮ Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment ⋮ Twelve surveys in operations research ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ On total variation minimization and surface evolution using parametric maximum flows ⋮ Lower and upper bounds for the non-linear generalized assignment problem ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Error minimization methods in biproportional apportionment ⋮ Surveys in operations research ⋮ Eleven surveys in operations research ⋮ Complexity and algorithms for nonlinear optimization problems