A Hybrid Model of Evolutionary Algorithms and Branch-And-Bound for Combinatorial Optimization Problems

doi 10.1109/cec.2005.1554974
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Evolutionary Algorithms for Dynamic Optimization Problems

2005English

A Comparison of Parallel Branch and Bound Algorithms for Location-Transportation Problems in Humanitarian Relief

International Journal of GEOMATE
BuildingGeotechnical EngineeringSoil ScienceEngineering GeologyConstructionEnvironmental Engineering
2017English

Enhanced Branch-And-Bound Framework for a Class of Sequencing Problems

IEEE Transactions on Systems, Man, and Cybernetics: Systems
ControlSystems EngineeringInformation SystemsHuman-Computer InteractionElectronic EngineeringComputer Science ApplicationsElectricalSoftware
2019English

A Qualitative Study of Model Based Approach With the Existing Approaches for Solving Combinatorial Optimization Problems Using Hybrid Strategies

International Journal of Modern Education and Computer Science
2017English

Performance Assessment of Evolutionary Algorithms in Power System Optimization Problems

2015English

A Simulation Tool for the Performance Evaluation of Parallel Branch and Bound Algorithms

Mathematical Programming, Series B
MathematicsSoftware
1988English

A Structural Optimization Solution to a Branch-And-Bound Problem

Quarterly of Applied Mathematics
Applied Mathematics
1977English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

A Survey on Handling Computationally Expensive Multiobjective Optimization Problems With Evolutionary Algorithms

Soft Computing
GeometrySoftwareTheoretical Computer ScienceTopology
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy