A global continuation algorithm for solving binary quadratic programming problems
From MaRDI portal
Publication:1029635
Recommendations
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- A continuous approach to binary quadratic problems
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- A continuous approch for globally solving linearly constrained quadratic
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
Cites work
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- A branch and bound algorithm for the maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- A special newton-type optimization method
- A unified modeling and solution framework for combinatorial optimization problems
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Convex Relaxations of (0, 1)-Quadratic Programming
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Pseudo-Boolean optimization
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Semidefinite programming for discrete optimization and matrix completion problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(16)- The unconstrained binary quadratic programming problem: a survey
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Adaptive randomization in network data
- Building an iterative heuristic solver for a quantum annealer
- An algorithm for nonlinear optimization problems with binary variables
- A continuous approach to binary quadratic problems
- A gradient-based approach for discrete optimum design
- Mathematical programming models and exact algorithms
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- A smoothing method for zero--one constrained extremum problems
- Combining discrete ellipsoid-based search and branch-and-cut for binary quadratic programming problems
This page was built for publication: A global continuation algorithm for solving binary quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029635)
