scientific article

From MaRDI portal

Revision as of 00:14, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3991501

Jump to:navigation, search

zbMath0747.90089MaRDI QIDQ3991501

Miroslav D. Asic, Vera V. Kovacevic-Vujcic

Publication date: 28 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-hardness global concave minimization hard test problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3991501&oldid=12054782"