Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty for zero–one integer equivalent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On affine scaling algorithms for nonconvex quadratic programming / 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

Latest revision as of 11:04, 6 June 2024

scientific article
Language Label Description Also known as
English
Penalty parameter for linearly constrained 0--1 quadratic programming
scientific article

    Statements

    Penalty parameter for linearly constrained 0--1 quadratic programming (English)
    0 references
    0 references
    27 October 2003
    0 references
    0-1 quadratic programming
    0 references
    continuous concave quadratic programming
    0 references
    global minimal value
    0 references
    penalty parameter
    0 references

    Identifiers