Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221): 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-006-9053-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076640191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667913 / 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: 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 continuous approach to nonlinear integer programming / 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: On Descent from Local Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)th power Lagrangian method for integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding global minima with a computable filled function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function applied to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / 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: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled functions for unconstrained global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719183 / 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: Integral global minimization: Algorithms, implementations and numerical tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank

Latest revision as of 18:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Discrete global descent method for discrete global optimization and nonlinear integer programming
scientific article

    Statements

    Discrete global descent method for discrete global optimization and nonlinear integer programming (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    0 references
    Discrete global descent method
    0 references
    Discrete global optimization
    0 references
    Nonlinear integer programming
    0 references
    Integer programming
    0 references
    0 references
    0 references
    0 references
    0 references