scientific article; zbMATH DE number 1505873

MaRDI QIDQ4504425zbMATH OpenFDO

Authors

Publication date 13 September 2000

zbMATH Keywords

box constraint polynomial programmingconstraint polynomial 0-1 integer programmingpenalty functionpolynomial 0-1 integer programming

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Optimization methods for a class of integer polynomial programming problems
• A class of polynomially solvable 0-1 programming problems and an application
• Integer Polynomial Optimization in Fixed Dimension
• A continuous solution to linear 0-1 programming
• Persistency in 0-1 polynomial programming
• scientific article; zbMATH DE number 5925034
• A continuous approach to nonlinear integer programming
• Polynomial approximations for continuous linear programs
• On the optimality of pseudo-polynomial algorithms for integer programming
• On the optimality of pseudo-polynomial algorithms for integer programming

Cited in

(1)

• Persistency in 0-1 polynomial 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 Q4504425)