An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Tao Pham Dinh / rank
Normal rank
 
Property / author
 
Property / author: Hoai An Le Thi / rank
Normal rank
 
Property / author
 
Property / author: Tao Pham Dinh / rank
 
Normal rank
Property / author
 
Property / author: Hoai An Le Thi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDP_S / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / 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/s10898-009-9507-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078721614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph separation techniques for quadratic zero-one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear complementarity problems by DC programming and DCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty in d. c. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicially-constrained DC optimization over efficient and weakly efficient sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 3 July 2024

scientific article
Language Label Description Also known as
English
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
scientific article

    Statements

    An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2010
    0 references
    0 references
    DC programming
    0 references
    DC algorithms (DCA)
    0 references
    nonconvex quadratic programming
    0 references
    exact penalty
    0 references
    DC relaxation
    0 references
    branch-and-bound (B\&B)
    0 references
    semidefinite programming (SDP)
    0 references
    binary quadratic programming (BQP)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references