Minimum weight covering problems in stochastic environments

Authors:
Yaodong Ni
Affiliations:
School of Information Technology and Management, University of International Business and Economics, Beijing 100029, China
Venue:
Information Sciences: an International Journal
Year:
2012

Citing 9
Cited 0

Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica
Constrained weighted matchings and edge coverings in graphs

Discrete Applied Mathematics
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Theory and Practice of Uncertain Programming

Theory and Practice of Uncertain Programming
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Novel state minimization and state assignment in finite state machine design for low-power portable devices

Integration, the VLSI Journal
Minimizing the expected complete influence time of a social network

Information Sciences: an International Journal
Recommendation of similar users, resources and social networks in a Social Internetworking Scenario

Information Sciences: an International Journal
The dynamic competitive recommendation algorithm in social network services

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Minimum weight covering problems have played an important role in many real applications. In this paper, two typical minimum weight covering problems, namely vertex covering problem and edge covering problem, are studied under stochastic environments. According to different decision criteria, we propose three stochastic programming models: the expected minimum weight cover model, @a-minimum weight cover model and the most minimum weight cover model. A hybrid intelligent algorithm that integrates stochastic simulation with genetic algorithm is designed to solve the proposed models. Finally, numerical experiments are performed to show the effectiveness and robustness of the proposed algorithm.