Functionally redundant constraints for Boolean quadratic-type optimization problems

DOI10.1007/S10559-006-0029-ZzbMATH Open1101.90042OpenAlexW2061537446MaRDI QIDQ852258FDOQ852258

Authors N. E. Zubov

Publication date 28 November 2006

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-006-0029-z

zbMATH Keywords

Boolean quadratic-type optimizationfunctionally redundant quadratic constraintsLagrangian dual quadratic estimates

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Recommendations

• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
• Method of obtaining estimates in quadratic extremal problems with Boolean variables
• Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
• scientific article; zbMATH DE number 706870

Cites work

• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Nondifferentiable optimization and polynomial problems
• Role of redundant constraints for improving dual bounds in polynomial optimization problems

Cited in

(6)

• The Boolean quadratic programming problem with generalized upper bound constraints
• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• The spherical constraint in Boolean quadratic programs
• New quadratic models for the maximum weighted cut problem
• Optimization problems for the maximum \(k\)-plex
• Continuous representations and functional extensions in combinatorial optimization

This page was built for publication: Functionally redundant constraints for Boolean quadratic-type optimization problems

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