Putting continuous metaheuristics to work in binary search spaces
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1702339 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 863497 (Why is no real title available?)
- A Note on the Generation of Random Normal Deviates
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A typology of cutting and packing problems
- Ant colony optimization for continuous domains
- Application of the firefly algorithm for solving the economic emissions load dispatch problem
- BGSA: Binary gravitational search algorithm
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Combinatorial optimization. Networks and matroids
- Differential Evolution for Binary Encoding
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Dynamical and spatial disorder in an intermittent search process
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- GSA: A gravitational search algorithm
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- Introduction to evolutionary computing
- Metaheuristics. From design to implementation.
- Metaheuristics: A bibliography
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Cited in
(7)- Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space
- Binary peacock algorithm: a novel metaheuristic approach for feature selection
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Binarization of the swallow swarm optimization for feature selection
- Lévy flights in binary optimization
- Optimal scale combination selection based on a monotonic variable precision multi-scale rough set model
- A binary monkey search algorithm variation for solving the set covering problem
This page was built for publication: Putting continuous metaheuristics to work in binary search spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012877)
