Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s10114-011-8351-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112847829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient continuation method for quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation for quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality for a trust-region type relaxation of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:29, 4 July 2024

scientific article
Language Label Description Also known as
English
Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
scientific article

    Statements

    Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (English)
    0 references
    0 references
    4 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex programming
    0 references
    quadratically constrained quadratic programming
    0 references
    quadratic assignment problem
    0 references
    polynomial solvability
    0 references
    strong duality
    0 references
    0 references