Testing optimality for quadratic 0?1 unconstrained problems

DOI10.1007/BF01432506zbMath0841.90095MaRDI QIDQ4859451

Federico Malucelli, Paolo Carraresi, Massimo Pappalardo

Publication date: 7 January 1996

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items

Some thoughts on combinatorial optimisation, The unconstrained binary quadratic programming problem: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of uniqueness and local search in quadratic 0-1 programming
• On the number of local maxima in quadratic 0-1 programs
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Boolean Elements in Combinatorial Optimization
• Methods of Nonlinear 0-1 Programming
• Convex Analysis