Edge covering problem under hybrid uncertain environments

DOI10.1016/J.AMC.2012.11.096MaRDI QIDQ371513zbMATH OpenOpenAlexFDO

Authors Yaodong Ni

Publication date 10 October 2013

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.11.096

zbMATH Keywords

edge covergenetic algorithmrandom fuzzy programmingrandom fuzzy simulationuncertainty modelling

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A hybrid approach to persistent coverage in stochastic environments
• Minmax regret maximal covering location problems with edge demands
• Fuzzy minimum weight edge covering problem
• Approximation Algorithms for Edge-Covering Problem
• Covering edges in networks
• Upgrading edges in the maximal covering location problem
• Approximation algorithms for partially covering with edges
• A mixed integer linear program and tabu search approach for the complementary edge covering problem

Cites work

• A 1-matching blossom-type algorithm for edge covering problems
• A genetic algorithm for the set covering problem
• An Algorithm for a Minimum Cover of a Graph
• An efficient algorithm for minimumk-covers in weighted graphs
• Chance-constrained programming
• Constrained weighted matchings and edge coverings in graphs
• Depedent-chance programming: A class of stochastic optimization
• Edge cover by connected bipartite subgraphs
• Edge covering pseudo-outerplanar graphs with forests
• Equivalence between the minimum covering problem and the maximum matching problem
• Expected Value Operator of Random Fuzzy Variable and Random Fuzzy Expected Value Models
• Fuzzy minimum weight edge covering problem
• Fuzzy random variables - I. Definitions and theorems
• Fuzzy random variables - II. Algorithms and examples for the discrete case
• Fuzzy sets
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• Minimum cost edge subset covering exactly k vertices of a graph
• Minimum Covers of Fixed Cardinality in Weighted Graphs
• On the roots of edge cover polynomials of graphs
• Theory and practice of uncertain programming
• Uncertainty theory. An introduction to its axiomatic foundations.

Cited in

(4)

• Fuzzy minimum weight edge covering problem
• Solving equilibrium standby redundancy optimization problem by hybrid PSO algorithm
• Set-weighted games and their application to the cover problem
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles

This page was built for publication: Edge covering problem under hybrid uncertain environments

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