Solving the unconstrained optimization problem by a variable neighborhood search
DOI10.1016/J.JMAA.2006.06.025zbMATH Open1275.90095OpenAlexW2024108781MaRDI QIDQ864633FDOQ864633
Authors: M. Duran Toksarı, Ertan Güner 
Publication date: 12 February 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.06.025
Recommendations
- Variable neighborhood search: Principles and applications
- Variable neighborhood search in global optimization
- Variable neighbourhood search: methods and applications
- Variable neighbourhood search: Methods and applications
- A generalized variable neighborhood search for combinatorial optimization problems
- scientific article; zbMATH DE number 1488097
- Fundamentals of variable neighborhood search
- General variable neighborhood search for the continuous optimization
- A variational method for unconstrained optimization problems
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Stochastic global optimization methods part II: Multi level methods
- A Simplex Method for Function Minimization
- A controlled random search procedure for global optimisation
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Global optimization and simulated annealing
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Variable neighborhood search for the maximum clique
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Sequential search and its application to vehicle-routing problems
- A variable neighborhood search for graph coloring.
- Ant colony optimization for finding the global minimum
- Variable neighborhood search for the linear ordering problem
- Stochastic Methods for Global Optimization
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Title not available (Why is that?)
- Global optimization and stochastic differential equations
- Global optimizations and tabu search based on memory
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Title not available (Why is that?)
- A global optimization algorithm using adaptive random search
Cited In (13)
- Heuristic methods for the optimal statistic median problem
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search: the power of change and simplicity
- Variable neighbourhood search: methods and applications
- Variable neighborhood search: basics and variants
- Fitting censored quantile regression by variable neighborhood search
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- Title not available (Why is that?)
- General variable neighborhood search for the continuous optimization
- A heuristic for nonlinear global optimization
- Gaussian variable neighborhood search for continuous optimization
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization
Uses Software
This page was built for publication: Solving the unconstrained optimization problem by a variable neighborhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864633)
