A sequential cutting plane algorithm for solving convex NLP problems

From MaRDI portal
Revision as of 02:08, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2496070

DOI10.1016/J.EJOR.2005.02.045zbMath1125.90038OpenAlexW2016771881WikidataQ114858777 ScholiaQ114858777MaRDI QIDQ2496070

Tapio Westerlund, Claus Still

Publication date: 30 June 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.045




Related Items (4)


Uses Software



Cites Work




This page was built for publication: A sequential cutting plane algorithm for solving convex NLP problems