Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2010.07.008 / 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.1016/j.orl.2010.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007120436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for a particular D.C. quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for solving nonconvex quadratic programs via branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of some branch and bound methods for indefinite quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving a class of D-C programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for global minimization of separable concave programs / 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: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2010.07.008 / rank
 
Normal rank

Latest revision as of 22:17, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
scientific article

    Statements

    Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (English)
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    d.c. programmings
    0 references
    nonconvex programming
    0 references
    branch and bound
    0 references

    Identifiers