A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
From MaRDI portal
Publication:6048167
DOI10.1080/0305215x.2021.1904918zbMath1523.90298MaRDI QIDQ6048167
No author found.
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- The bi-objective covering tour problem
- Hybrid metaheuristics. An emerging approach to optimization.
- Mesh adaptive direct search algorithms for mixed variable optimization
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Embedding branch and bound within evolutionary algorithms
- Multi-objective branch and bound
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Performance indicators in multiobjective optimization
- Exploration and exploitation in evolutionary algorithms
- Hybridizations of Metaheuristics With Branch & Bound Derivates
- Hybrid Metaheuristics
- Direct Multisearch for Multiobjective Optimization
- An Automatic Method of Solving Discrete Programming Problems
- An Algorithm for Multiobjective Zero-One Linear Programming
- Evolutionary Computation in Combinatorial Optimization
- Solving vehicle routing problems using constraint programming and metaheuristics
This page was built for publication: A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
