A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
doi 10.14569/ijarai.2015.040607
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Science and Information Organization

Related search

A Heuristic for the Minimum Cost Chromatic Partition Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2020English

A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

Journal of Optimization
2017English

A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem

Production and Manufacturing Research
IndustrialManufacturing Engineering
2014English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

A Heuristic Approach to Innovative Problem Solving

International Journal of Engineering Research and Applications
2017English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

The Minimum K-Cover Problem

Applied Mathematical Sciences
2013English

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

Mathematical and Computational Applications
2013English

Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy