Une borne optimale pour la programmation entière quasi-convexe

DOI10.24033/bsmf.2210zbMath0777.90034OpenAlexW2314059798MaRDI QIDQ3136700

Reinhard Mandel, Teresa Krick, Pablo Solernó, Joos Heintz, Bernd Bank

Publication date: 20 October 1993

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1993__121_2_299_0

zbMATH Keywords

system of polynomial inequalitiesquasiconvex polynomialsgeometrical bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• Homotopy and crossings of systems of curves on a surface
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Sur la complexité du principe de Tarski-Seidenberg
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item