Solving the unconstrained optimization problem by a variable neighborhood search
From MaRDI portal
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
Cites work
- A controlled random search procedure for global optimisation
- A global optimization algorithm using adaptive random search
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A Simplex Method for Function Minimization
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- A variable neighborhood search for graph coloring.
- Ant colony optimization for finding the global minimum
- Global optimization and simulated annealing
- Global optimization and stochastic differential equations
- Global optimizations and tabu search based on memory
- scientific article; zbMATH DE number 3712697 (Why is no real title available?)
- scientific article; zbMATH DE number 3609472 (Why is no real title available?)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Sequential search and its application to vehicle-routing problems
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Stochastic global optimization methods part II: Multi level methods
- Stochastic Methods for Global Optimization
- Variable neighborhood search
- Variable neighborhood search for the linear ordering problem
- Variable neighborhood search for the maximum clique
- Variable neighborhood search: Principles and applications
Cited in
(14)- Variable neighbourhood search: Methods and applications
- A heuristic for nonlinear global optimization
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Variable neighborhood search: basics and variants
- Gaussian variable neighborhood search for continuous optimization
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- scientific article; zbMATH DE number 2156686 (Why is no real title available?)
- Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization
- Variable neighborhood search: the power of change and simplicity
- Heuristic methods for the optimal statistic median problem
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- Fitting censored quantile regression by variable neighborhood search
- General variable neighborhood search for the continuous optimization
- Variable neighbourhood search: methods and applications
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)
