scientific article; zbMATH DE number 1505873

zbMATH Open0961.90066MaRDI QIDQ4504425

Author name not available (Why is that?)

Publication date: 13 September 2000

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

zbMATH Keywords

penalty functionbox constraint polynomial programmingconstraint polynomial 0-1 integer programmingpolynomial 0-1 integer programming

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

Persistency in 0-1 polynomial programming

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A class of polynomially solvable 0-1 programming problems and an application 👍 👎
• A continuous approach to nonlinear integer programming 👍 👎
• On the optimality of pseudo-polynomial algorithms for integer programming 👍 👎
• Persistency in 0-1 polynomial programming 👍 👎
• Polynomial approximations for continuous linear programs 👍 👎
• Optimization methods for a class of integer polynomial programming problems 👍 👎
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming 👍 👎
• Integer Polynomial Optimization in Fixed Dimension 👍 👎

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 Q4504425)