Results 31 to 40 of about 1,485,911 (189)
Greedy Genetic Algorithm for the Data Aggregator Positioning Problem in Smart Grids
Inteligencia Artificial, 2021 In this work, we present a metaheuristic based on the genetic and greedy algorithms to solve an application of the set covering problem (SCP), the data aggregator positioning in smart grids.
Sami Nasser Lauar, Mario Mestria
doaj +1 more source
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network
, 2010 The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks.
A. Agnetis +20 more
core +1 more source
A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem [PDF]
, 2015 The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods.
Crawford, Broderick +7 more
core +1 more source
Efficiency comparison of exact and approximate algorithms for solving set covering problem
Advanced Engineering Research, 2017 Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov +2 more
doaj +1 more source
Application of Set Covering Location Problem for Organizing the Public Postal Network
Promet (Zagreb), 2016 Most countries of the European Union ensure certain obligations (criteria) which universal service providers must meet to ensure the realization of the universal service.
Dragana Šarac +4 more
doaj +1 more source
Covering problems in edge- and node-weighted graphs
, 2014 This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a
A. Berger +18 more
core +1 more source
Allocating costs in set covering problems [PDF]
European Journal of Operational Research, 2020 This paper deals with the problem of allocating costs in set covering situations. In particular, we focus on set covering situations where the optimal covering is given in advance. Thus, we take into account only the facilities that have to be opened and look for rules distributing their cost.
Bergantiño Cid, Gustavo +4 more
openaire +3 more sources
Theoretical Computer Science, 2011 6 pages, 1 figure, submitted to Theoretical Computer ...
Ren, Wei, Zhao, Qing
openaire +3 more sources
Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2018 Bandar Lampung merupakan kota besar di Indonesia yang akan berkembang menjadi kota metropolitan. Perkembangan kota dapat dipercepat dengan pembangunan infrastruktur pelayanan publik.
Heri Wibowo +2 more
doaj +1 more source
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets [PDF]
, 2011 Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to ...
Gupta, Anupam +2 more
core