The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory

DOI10.1155/2020/5359691zbMATH Open1459.90190OpenAlexW3035788012MaRDI QIDQ779535FDOQ779535

Publication date: 13 July 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5359691

Recommendations

An attribute reduction method based on rough sets for set covering problem
The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
A rough set method for the vertex cover problem in graph theory
A set-cover-based approach for the test-cost-sensitive attribute reduction problem
Some NP-complete problems for attribute reduction in consistent decision tables

Combinatorial optimization (90C27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites Work

Rough sets
Soft set theory -- first results
Title not available (Why is that?)
Soft sets and soft rough sets
The Location of Emergency Service Facilities
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
An effective and simple heuristic for the set covering problem
THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
Positive approximation: an accelerator for attribute reduction in rough set theory
Title not available (Why is that?)
Solving hard set covering problems
Title not available (Why is that?)
Title not available (Why is that?)
A Heuristic Method for the Set Covering Problem
A GRASP algorithm to solve the unicost set covering problem
A parallel genetic algorithm to solve the set-covering problem
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Discernibility matrix simplification for constructing attribute reducts
Title not available (Why is that?)
Title not available (Why is that?)
Reduction algorithms based on discernibility matrix: The ordered attributes method
Fuzzy preference based rough sets
A hierarchical model for test-cost-sensitive decision systems
COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
Quick attribute reduction in inconsistent decision tables
A set covering based approach to find the reduct of variable precision rough set
A set-cover-based approach for the test-cost-sensitive attribute reduction problem
\(N\)-soft sets and their decision making algorithms
Hybrid heuristics for minimum cardinality set covering problems
Title not available (Why is that?)
Spatio-temporal approximate reasoning over complex objects
An efficient mean field approach to the set covering problem

This page was built for publication: The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779535)