A global continuation algorithm for solving binary quadratic programming problems (Q1029635): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(8 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-007-9110-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NEOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SBB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9110-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011044831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 Quadratic programming approach for optimum solutions of two scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty approach for solving a class of minimization problems with boolean variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of monotone complementarity problems with locally Lipschitzian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified modeling and solution framework for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the Complementarity Problem to a System of Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained 0-1 nonlinear programming: A nondifferentiable approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming for discrete optimization and matrix completion problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-007-9110-4 / rank
 
Normal rank

Latest revision as of 13:50, 10 December 2024

scientific article
Language Label Description Also known as
English
A global continuation algorithm for solving binary quadratic programming problems
scientific article

    Statements

    A global continuation algorithm for solving binary quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2009
    0 references
    binary quadratic programming
    0 references
    Fischer-Burmeister function
    0 references
    logarithmic barrier function
    0 references
    global continuation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers