Finding discrete global minima with a filled function for integer programming (Q2477662): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of filled functions for finding global minimizers of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The globally convexized filled functions for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled functions for unconstrained global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several filled functions with mitigators. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of generalized filled functions with improved computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods and applications: A categorized survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approach to nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete global descent method for discrete global optimization and nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming for various forms of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete filled function method for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer on global integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral global minimization: Algorithms, implementations and numerical tests / rank
 
Normal rank

Latest revision as of 19:32, 27 June 2024

scientific article
Language Label Description Also known as
English
Finding discrete global minima with a filled function for integer programming
scientific article

    Statements

    Finding discrete global minima with a filled function for integer programming (English)
    0 references
    14 March 2008
    0 references
    0 references
    filled function
    0 references
    global optimization
    0 references
    integer programming
    0 references
    local minimizer
    0 references
    global minimizer
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references