scientific article; zbMATH DE number 4133835

zbMATH Open0692.90074MaRDI QIDQ3035143FDOQ3035143

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

Publication date: 1990

Title of this publication is not available (Why is that?)

zbMATH Keywords

boundquasiconvex polynomialsbinary length

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (3)

• Complexity of integer quasiconvex polynomial optimization
• Title not available (Why is that?)
• Lower bounds for polynomials with simplex Newton polytopes based on geometric programming

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Lower bounds for polynomials with simplex Newton polytopes based on geometric programming 👍 👎
• Lower bounds for polynomials using geometric programming 👍 👎
• A Geometric Buchberger Algorithm for Integer Programming 👍 👎
• Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity 👍 👎
• A polynomial case of convex integer quadratic programming problems with box integer constraints 👍 👎
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming 👍 👎

This page was built for publication:

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