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

DOI10.24033/BSMF.2210zbMATH Open0777.90034OpenAlexW2314059798MaRDI QIDQ3136700FDOQ3136700

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

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

zbMATH Keywords

system of polynomial inequalitiesquasiconvex polynomialsgeometrical bound

Mathematics Subject Classification ID

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

Cites Work

• Convex Analysis
• Sur la complexité du principe de Tarski-Seidenberg
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Homotopy and crossings of systems of curves on a surface
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

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

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)