Testing optimality for quadratic 0?1 unconstrained problems

DOI10.1007/BF01432506MaRDI QIDQ4859451zbMATH OpenFDO

Authors Federico Malucelli, Paolo Carraresi, Massimo Pappalardo

Publication date 7 January 1996

Published in ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01432506

zbMATH Keywords

convex analysisnecessary and sufficient condition\(\varepsilon\)-subgradientquadratic pseudo-Boolean unconstrained problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Nonsmooth analysis (49J52) Boolean programming (90C09)

Recommendations

• Testing optimality for quadratic 0-1 problems
• scientific article; zbMATH DE number 4116303
• The quadratic M-convexity testing problem
• Remarks on solutions to a nonconvex quadratic programming test problem
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
• scientific article; zbMATH DE number 1539044
• Optimality conditions for the minimization of quadratic 0-1 problems
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• scientific article; zbMATH DE number 1199854

Cites work

• scientific article; zbMATH DE number 16313 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Boolean Elements in Combinatorial Optimization
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Convex Analysis
• Methods of Nonlinear 0-1 Programming
• On the number of local maxima in quadratic 0-1 programs

Cited in

(8)

• Active constraints, indefinite quadratic test problems, and complexity
• Some thoughts on combinatorial optimisation
• The unconstrained binary quadratic programming problem: a survey
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Construction of test problems in quadratic bivalent programming
• The quadratic M-convexity testing problem
• Simple Tests for Classifying Critical Points of Quadratics with Linear Constraints
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables

This page was built for publication: Testing optimality for quadratic 0?1 unconstrained problems

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