Edge covering problem under hybrid uncertain environments
type: Item
instance of: scholarly article
title: Edge covering problem under hybrid uncertain environments
zbMATH Open document ID: 1272.05162
author: Yaodong Ni
published in: Applied Mathematics and Computation
publication date: 2013-10-10T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6214568
zbMATH Keywords: uncertainty modelling
zbMATH Keywords: edge cover
zbMATH Keywords: random fuzzy programming
zbMATH Keywords: random fuzzy simulation
zbMATH Keywords: genetic algorithm
MaRDI profile type: Publication
full work available at URL: j.amc.2012.11.096
OpenAlex ID: W1977459974
cites work: An Algorithm for a Minimum Cover of a Graph
cites work: Edge covering pseudo-outerplanar graphs with forests
cites work: Edge cover by connected bipartite subgraphs
cites work: On the roots of edge cover polynomials of graphs
cites work: Minimum Covers of Fixed Cardinality in Weighted Graphs
cites work: A 1-matching blossom-type algorithm for edge covering problems
cites work: Equivalence between the minimum covering problem and the maximum matching problem
cites work: An efficient algorithm for minimumk-covers in weighted graphs
cites work: Constrained weighted matchings and edge coverings in graphs
cites work: Minimum cost edge subset covering exactly \(k\) vertices of a graph
cites work: Fuzzy minimum weight edge covering problem
cites work: Fuzzy random variables - I. Definitions and theorems
cites work: Fuzzy random variables - II. Algorithms and examples for the discrete case
cites work: Uncertainty theory. An introduction to its axiomatic foundations.
cites work: Fuzzy sets
cites work: Expected Value Operator of Random Fuzzy Variable and Random Fuzzy Expected Value Models
cites work: Chance-constrained programming
cites work: Theory and practice of uncertain programming
cites work: Depedent-chance programming: A class of stochastic optimization
cites work: Q4079017
cites work: A genetic algorithm for the set covering problem
DOI: 10.1016/J.AMC.2012.11.096
Recommended article: A hybrid approach to persistent coverage in stochastic environments
Recommended article: Minmax regret maximal covering location problems with edge demands
Recommended article: Fuzzy minimum weight edge covering problem
Recommended article: Approximation Algorithms for Edge-Covering Problem
Recommended article: Constraint solving via fractional edge covers
Recommended article: Covering edges in networks
Recommended article: Upgrading edges in the maximal covering location problem
Recommended article: Approximation algorithms for partially covering with edges
Recommended article: A mixed integer linear program and tabu search approach for the complementary edge covering problem
description: scientific article; zbMATH DE number 6214568