A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2018.08.005 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: QuadProgBB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889300168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonconvex Quadratic Programming with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct active set algorithm for large sparse quadratic programs with simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polytope for a Product of Real Linear Functions in 0/1 Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Bilinear Problems Using MILP Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129270668 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2018.08.005 / rank
 
Normal rank

Latest revision as of 21:01, 17 December 2024

scientific article
Language Label Description Also known as
English
A binarisation heuristic for non-convex quadratic programming with box constraints
scientific article

    Statements

    A binarisation heuristic for non-convex quadratic programming with box constraints (English)
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    global optimisation
    0 references
    heuristics
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers