A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

DOI10.1016/j.amc.2010.05.009zbMath1200.65048OpenAlexW2015972284MaRDI QIDQ708127

Volker Rehbock, Siew Fang Woon

Publication date: 11 October 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11937/42716

zbMATH Keywords

numerical resultsheuristicnonlinear discrete optimizationdiscrete filled functiondiscrete global optimizationmultiple local minima

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An augmented filled function for global nonlinear integer optimization, Discrete global optimization problems with a modified discrete filled function, A continuously differentiable filled function method for global optimization, An auxiliary function method for global minimization in integer programming, Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization, The role of different genetic operators in the optimization of magnetic models, A filled function which has the same local minimizer of the objective function

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer on global integer optimization
• A simple tabu search for warehouse location
• A new discrete filled function algorithm for discrete global optimization
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• A filled function method for finding a global minimizer of a function of several variables
• A filled function method for constrained nonlinear integer programming
• More test examples for nonlinear programming codes
• Test example for nonlinear programming codes
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• A branch and bound algorithm for solving separable convex integer programming problems
• A continuous approach to nonlinear integer programming
• An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
• When the greedy algorithm fails
• Finding discrete global minima with a filled function for integer programming
• Discrete filled function method for discrete global optimization
• A new filled function method for nonlinear integer programming problem
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
• New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
• Can Pure Cutting Plane Algorithms Work?
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• A Greedy Heuristic for the Set-Covering Problem
• Testing Unconstrained Optimization Software
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• A hybrid approach to discrete mathematical programming
• Steady-state genetic algorithms for discrete optimization of trusses
• GROUPS WITH EXACTLY TWO SUBGROUPS OF GIVEN ORDER
• On the Exact Separation of Mixed Integer Knapsack Cuts
• A gradually descent method for discrete global optimization
• On Descent from Local Minima
• An approximate algorithm for nonlinear integer programming