An approach to the subproblem of the cutting angle method of global optimization (Q813345): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-004-1687-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010968185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting angle methods in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of increasing positively homogeneous functions over the unit simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting angle method and a local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing increasing star-shaped functions based on abstract convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> / rank
 
Normal rank

Latest revision as of 11:12, 24 June 2024

scientific article
Language Label Description Also known as
English
An approach to the subproblem of the cutting angle method of global optimization
scientific article

    Statements

    An approach to the subproblem of the cutting angle method of global optimization (English)
    0 references
    0 references
    8 February 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    assignment problem
    0 references
    cutting angle method
    0 references
    dominant subset with minimal weight problem
    0 references
    global optimization problem
    0 references
    heuristic algorithm
    0 references
    knapsack problem
    0 references
    NP-complete
    0 references
    0 references