A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1080/0305215x.2021.1904918 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Mesh adaptive direct search algorithms for mixed variable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance indicators in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving vehicle routing problems using constraint programming and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridizations of Metaheuristics With Branch & Bound Derivates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding branch and bound within evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration and exploitation in evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Multisearch for Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid metaheuristics. An emerging approach to optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-objective covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Multiobjective Zero-One Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for two-stage hybrid flow shop with dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495207 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1080/0305215X.2021.1904918 / rank
 
Normal rank

Latest revision as of 17:56, 30 December 2024

scientific article; zbMATH DE number 7747850
Language Label Description Also known as
English
A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
scientific article; zbMATH DE number 7747850

    Statements

    A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (English)
    0 references
    10 October 2023
    0 references
    multi-criteria
    0 references
    branch-and-bound algorithm
    0 references
    NSGAII
    0 references
    MINLP problems
    0 references
    mixed variables
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references