A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When the greedy algorithm fails / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Separation of Mixed Integer Knapsack Cuts / 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: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Descent from Local Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for nonlinear integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables / 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 example for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving separable convex integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to discrete mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple tabu search for warehouse location / 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 global descent method for discrete global optimization and nonlinear integer programming / 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: An improved simulated annealing simulation optimization method for discrete parameter stochastic systems / 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: A filled function method for finding a global minimizer on global integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding discrete global minima with a filled function for integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3081991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steady-state genetic algorithms for discrete optimization of trusses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GROUPS WITH EXACTLY TWO SUBGROUPS OF GIVEN ORDER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new discrete filled function algorithm for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for constrained nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gradually descent method for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Pure Cutting Plane Algorithms Work? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank

Latest revision as of 08:08, 3 July 2024

scientific article
Language Label Description Also known as
English
A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
scientific article

    Statements

    A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (English)
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete filled function
    0 references
    discrete global optimization
    0 references
    nonlinear discrete optimization
    0 references
    heuristic
    0 references
    multiple local minima
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references