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

DOI10.24033/BSMF.2210MaRDI QIDQ3136700zbMATH OpenOpenAlexFDO

Authors Joos Heintz, Teresa Krick, Reinhard Mandel, Pablo Solernó, 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, https://eudml.org/doc/87668

zbMATH Keywords

system of polynomial inequalitiesquasiconvex polynomialsgeometrical bound

Mathematics Subject Classification ID

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

Recommendations

• On boundedness of (quasi-)convex integer optimization problems
• scientific article; zbMATH DE number 3970529
• scientific article; zbMATH DE number 826948
• On the complexity of quasiconvex integer minimization problem
• New bounds on the unconstrained quadratic integer programming problem
• scientific article; zbMATH DE number 1054751
• A continuous method for computing bounds in integer quadratic optimization problems
• scientific article; zbMATH DE number 4008100
• Ellipsoid bounds for convex quadratic integer programming

Cites work

• scientific article; zbMATH DE number 4154415 (Why is no real title available?)
• scientific article; zbMATH DE number 3945887 (Why is no real title available?)
• scientific article; zbMATH DE number 4074815 (Why is no real title available?)
• scientific article; zbMATH DE number 3733656 (Why is no real title available?)
• scientific article; zbMATH DE number 42759 (Why is no real title available?)
• scientific article; zbMATH DE number 193113 (Why is no real title available?)
• Convex Analysis
• 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

Cited in

(13)

• New bounds on the unconstrained quadratic integer programming problem
• scientific article; zbMATH DE number 3988071 (Why is no real title available?)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• Complexity of integer quasiconvex polynomial optimization
• On lower bounds for a class of quadratic 0,1 programs
• scientific article; zbMATH DE number 4074815 (Why is no real title available?)
• A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
• Extensions on ellipsoid bounds for quadratic integer programming
• A quantitative Doignon-Bell-Scarf theorem
• scientific article; zbMATH DE number 125290 (Why is no real title available?)
• On boundedness of (quasi-)convex integer optimization problems
• Integer optimization on convex semialgebraic sets

This page was built for publication: Une borne optimale pour la programmation entière quasi-convexe

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136700)