CHN and Swap Heuristic to Solve the Maximum Independent Set Problem

International Journal of Electrical and Computer Engineering - Indonesia
doi 10.11591/ijece.v7i6.pp3583-3592
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Advanced Engineering and Science

Related search

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

Mathematical and Computational Applications
2013English

An Unconstrained Binary Quadratic Programming for the Maximum Independent Set Problem

Nonlinear Analysis: Modelling and Control
Applied MathematicsAnalysis
2012English

Evaluation of Two Heuristic Approaches to Solve the Ontology Meta-Matching Problem

Knowledge and Information Systems
Information SystemsHuman-Computer InteractionHardwareArchitectureArtificial IntelligenceSoftware
2009English

Meta-Heuristic Combining Genetics Algorithm and Statistical Probality to Solve Traveling Salesman Problem.

Journal of Computer Science and Cybernetics
2012English

Using a Hybrid Heuristic to Solve the Balanced Vehicle Routing Problem With Loading Constraints

International Journal of Industrial Engineering Computations
IndustrialManufacturing Engineering
2020English

Message Passing for Maximum Weight Independent Set

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2009English

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

Optimized Crossover for the Independent Set Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1997English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy