A global continuation algorithm for solving binary quadratic programming problems
From MaRDI portal
Publication:1029635
DOI10.1007/S10589-007-9110-4zbMATH Open1168.90571OpenAlexW2011044831MaRDI QIDQ1029635FDOQ1029635
Authors: Tao Tan, Yuxi Jiang, Shaohua Pan 
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9110-4
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
Fischer-Burmeister functionbinary quadratic programminglogarithmic barrier functionglobal continuation algorithm
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Pseudo-Boolean optimization
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A unified modeling and solution framework for combinatorial optimization problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A special newton-type optimization method
- A Decomposition Method for Quadratic Zero-One Programming
- Semidefinite programming for discrete optimization and matrix completion problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Convex Relaxations of (0, 1)-Quadratic Programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch and bound algorithm for the maximum clique problem
- Title not available (Why is that?)
- An exact penalty approach for solving a class of minimization problems with boolean variables
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A quadratic assignment formulation of the molecular conformation problem
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
Cited In (16)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- The unconstrained binary quadratic programming problem: a survey
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- An algorithm for nonlinear optimization problems with binary variables
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Combining discrete ellipsoid-based search and branch-and-cut for binary quadratic programming problems
- A continuous approach to binary quadratic problems
- Adaptive randomization in network data
- 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
- Mathematical Programming Models and Exact Algorithms
- A smoothing method for zero--one constrained extremum problems
- Building an iterative heuristic solver for a quantum annealer
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- A gradient-based approach for discrete optimum design
Uses Software
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)
