Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
DOI10.1007/s00500-021-05670-zzbMath1498.05256OpenAlexW3133786076MaRDI QIDQ2098337
Anushree Bhattacharya, Madhumangal Pal
Publication date: 18 November 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-021-05670-z
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy colouring of fuzzy graphs
- Intuitionistic fuzzy competition graphs
- On the hardness of approximating minimum vertex cover
- Improved approximation algorithms for geometric set cover
- Generalized coverage: new developments in covering location models
- Fuzzy minimum weight edge covering problem
- Conditional covering: greedy heuristics and computational results
- Fuzzy graphs in the evaluation and optimization of networks
- Operations on fuzzy graphs
- Fuzzy graphs and fuzzy hypergraphs
- Unified approach to fuzzy graph problems
- Fuzzy \(\phi\)-tolerance competition graphs
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Covering models and optimization techniques for emergency response facility location and planning: a review
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- Covering problem on fuzzy graphs and its application in disaster management system
- A study on \(m\)-polar fuzzy planar graphs
- \(m\)-step fuzzy competition graphs
- New heuristics for the conditional covering problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- An Analysis of Network Location Problems with Distance Constraints
- A defensive maximal covering problem on a network
- On Fuzzy Mapping and Control
- Operations on fuzzy numbers
- Algorithms for solving the conditional covering problem on paths
- Cliques and clique covers in fuzzy graphs1
- Faces and dual of m-polar fuzzy planar graphs
- A study on bipolar fuzzy graphs
- Some optimal inapproximability results
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Fuzzy sets
- The Location of Emergency Service Facilities
This page was built for publication: Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
