Continuous Approaches to the Unconstrained Binary Quadratic Problems

DOI10.1007/978-3-319-30379-6_62zbMath1355.90059OpenAlexW2478171083MaRDI QIDQ2958833

No author found.

Publication date: 3 February 2017

Published in: Mathematical and Computational Approaches in Advancing Modern Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30379-6_62

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

The polyhedral-surface cutting plane method of optimization over a vertex-located set, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Properties of combinatorial optimization problems over polyhedral-spherical sets, The method of artificial space dilation in problems of optimal packing of geometric objects, Unnamed Item

Cites Work

• The unconstrained binary quadratic programming problem: a survey
• An algorithm for nonlinear optimization problems with binary variables
• Construction of convex continuations for functions defined on a hypersphere
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• The theory of convex continuations of functions at the vertices of convex polygons
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• Unnamed Item