Continuous Approaches to the Unconstrained Binary Quadratic Problems

DOI10.1007/978-3-319-30379-6_62MaRDI QIDQ2958833zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• A continuous approach to binary quadratic problems
• The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
• A continuous method for computing bounds in integer quadratic optimization problems
• The unconstrained binary quadratic programming problem: a survey
• A global continuation algorithm for solving binary quadratic programming problems
• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
• scientific article; zbMATH DE number 4025174
• An unconstrained convex programming approach to solving convex quadratic programming problems
• Binary quadratic optimization problems that are difficult to solve by conic relaxations

Cites work

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

Cited in

(7)

• Properties of combinatorial optimization problems over polyhedral-spherical sets
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• A continuous approach to binary quadratic problems
• Continuous extensions on Euclidean combinatorial configurations
• The polyhedral-surface cutting plane method of optimization over a vertex-located set
• The method of artificial space dilation in problems of optimal packing of geometric objects

This page was built for publication: Continuous Approaches to the Unconstrained Binary Quadratic Problems

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