Testing optimality for quadratic 0?1 unconstrained problems
DOI10.1007/BF01432506zbMATH Open0841.90095MaRDI QIDQ4859451FDOQ4859451
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)
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
convex analysisnecessary and sufficient condition\(\varepsilon\)-subgradientquadratic pseudo-Boolean unconstrained problems
Quadratic programming (90C20) Combinatorial optimization (90C27) Nonsmooth analysis (49J52) Boolean programming (90C09)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Methods of Nonlinear 0-1 Programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Title not available (Why is that?)
- On the number of local maxima in quadratic 0-1 programs
- Boolean Elements in Combinatorial Optimization
Cited In (8)
- Some thoughts on combinatorial optimisation
- Active constraints, indefinite quadratic test problems, and complexity
- 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
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Simple Tests for Classifying Critical Points of Quadratics with Linear Constraints
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)
