scientific article; zbMATH DE number 1560333

From MaRDI portal

Publication:4527183

Jump to:navigation, search

zbMath0976.90076MaRDI QIDQ4527183

Victor Klee, Peter Gritzmann, Andreas Brieden

Publication date: 1 February 2001

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

zbMATH Keywords

algorithm quadratic programming approximation width diameter circumradius simplex polynomial time inradius performance ratio APX-hardness parallelotope APX-completeness pseudo-Boolean programming norm maximization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (3)

Polynomial-time approximation of largest simplices in \(V\)-polytopes. ⋮ Complexity results for some global optimization problems ⋮ Unnamed Item

This page was built for publication:

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