Embedding branch and bound within evolutionary algorithms
From MaRDI portal
Recommendations
- Hybridizations of metaheuristics with branch \& bound derivates
- scientific article; zbMATH DE number 1935510
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
- Branch and bound crossed with GA to solve hybrid flowshops
- Improving the performance of enumerative search methods. II: Computational experiments
Cited in
(13)- Local search-based hybrid algorithms for finding Golomb rulers
- Evolutionary hybrid approaches for generation scheduling in power systems
- Computer simulation-based optimisation: hybrid branch and bound and orthogonal array-based enumeration algorithm
- Hybridizations of evolutionary algorithms with large neighborhood search
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
- Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
- A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions
- Iterative patching and the asymmetric traveling salesman problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Scatter search with path relinking for phylogenetic inference
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
This page was built for publication: Embedding branch and bound within evolutionary algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405381)
