greedy algorithms
Recently Published Documents


TOTAL DOCUMENTS

499
(FIVE YEARS 204)

H-INDEX

34
(FIVE YEARS 10)

2022 ◽  
Vol 5 (2) ◽  
pp. 59-65
Author(s):  
Shazia Abbasi ◽  
Khalil Khoumbati ◽  
Muhammad Memon ◽  
Shahzad Memon

Managing interference in the multi-radio networks is critical challenge; problem becomes even more serious in 2.4 GHz band due to minimal availability of orthogonal channels. This work attempts to propose a channel assignment scheme for interference zones of 2.4 GHz backhaul of Wireless Mesh Networks (WMN). The static nodes of Infrastructure based Backhaul employing directional antennas to connect static nodes, orthogonal channel zones introducing Interference are formatted with the selection of single tire direct hop and two tier directional hopes. The effort maintain the orthogonality of channels on system thus reduce the co-channel interference between inter flow and intra flow links. Group of non-overlapping channels of selected band are obtained by a mathematical procedure, interference is modeled by directed graph and Channel assignment is carried out with the help of greedy algorithms. Experimental analysis of the technical proposal is done by simulation through OPNET 14. Our framework can act as an imperative way to enhance the network performance resulting a leading improvement in system throughput and reduction in system delay


2021 ◽  
Vol 24 (68) ◽  
pp. 123-137
Author(s):  
Sami Nasser Lauar ◽  
Mario Mestria

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. The GGH (Greedy Genetic Hybrid) is structured as a genetic algorithm, but it has many modifications compared to the classic version. At the mutation step, only columns included in the solution can suffer mutation and be removed. At the recombination step, only columns from the parent’s solutions are available to generate the offspring. Moreover, the greedy algorithm generates the initial population, reconstructs solutions after mutation, and generates new solutions from the recombination step. Computational results using OR-Library problems showed that the GGH reached optimal solutions for 40 instances in a total of 75 and, in the other instances, obtained good and promising values, presenting a medium gap of 1,761%.


Author(s):  
Yichen Yang ◽  
Zhaohui Liu

In this paper, we consider the problem of finding a sparse solution, with a minimal number of nonzero components, for a set of linear inequalities. This optimization problem is combinatorial and arises in various fields such as machine learning and compressed sensing. We present three new heuristics for the problem. The first two are greedy algorithms minimizing the sum of infeasibilities in the primal and dual spaces with different selection rules. The third heuristic is a combination of the greedy heuristic in the dual space and a local search algorithm. In numerical experiments, our proposed heuristics are compared with the weighted-[Formula: see text] algorithm and DCA programming with three different non-convex approximations of the zero norm. The computational results demonstrate the efficiency of our methods.


PAMM ◽  
2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Kristof Albrecht ◽  
Armin Iske

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Xue Yu ◽  
Yifan Sun ◽  
Hai-Jun Zhou

AbstractHigh-dimensional linear regression model is the most popular statistical model for high-dimensional data, but it is quite a challenging task to achieve a sparse set of regression coefficients. In this paper, we propose a simple heuristic algorithm to construct sparse high-dimensional linear regression models, which is adapted from the shortest-solution guided decimation algorithm and is referred to as ASSD. This algorithm constructs the support of regression coefficients under the guidance of the shortest least-squares solution of the recursively decimated linear models, and it applies an early-stopping criterion and a second-stage thresholding procedure to refine this support. Our extensive numerical results demonstrate that ASSD outperforms LASSO, adaptive LASSO, vector approximate message passing, and two other representative greedy algorithms in solution accuracy and robustness. ASSD is especially suitable for linear regression problems with highly correlated measurement matrices encountered in real-world applications.


Author(s):  
Dávid Szeszlér

AbstractGreedy algorithms are among the most elementary ones in theoretical computer science and understanding the conditions under which they yield an optimum solution is a widely studied problem. Greedoids were introduced by Korte and Lovász at the beginning of the 1980s as a generalization of matroids. One of the basic motivations of the notion was to extend the theoretical background behind greedy algorithms beyond the well-known results on matroids. Indeed, many well-known algorithms of a greedy nature that cannot be interpreted in a matroid-theoretical context are special cases of the greedy algorithm on greedoids. Although this algorithm turns out to be optimal in surprisingly many cases, no general theorem is known that explains this phenomenon in all these cases. Furthermore, certain claims regarding this question that were made in the original works of Korte and Lovász turned out to be false only most recently. The aim of this paper is to revisit and straighten out this question: we summarize recent progress and we also prove new results in this field. In particular, we generalize a result of Korte and Lovász and thus we obtain a sufficient condition for the optimality of the greedy algorithm that covers a much wider range of known applications than the original one.


2021 ◽  
Vol 22 (4) ◽  
Author(s):  
Amin Rezaeipanah ◽  
Fariba Sarhangnia ◽  
MohammadJavad Abdollahi

In today’s competitive business world, manufacturers need to accommodate customer demands with appropriate scheduling. This requires efficient manufacturing chain scheduling. One of the most important problems that has always been considered in the manufacturing and job-shop industries is offering various products according to the needs of customers in different periods of time, within the shortest possible time and with rock-bottom cost. Job-Shop Scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in various aspects of construction and design. In addition, these systems are identified as Cellular Manufacturing Systems (CMS). Today, applying CMS and the use of its benefits have been very important as a possible way to increase the speed of the organization’s response to rapid market changes. In this paper, a meta-heuristic method based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated in a greedy algorithm and several elitist operators are used to improve the solutions. The greedy algorithm which is used to improve the generation of the initial population prioritizes the cells and the job in each cell, and thus offers quality solutions. The proposed algorithm is tested over P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality and run-time criteria were used in a multi-objective function. The results of simulation indicate better performance of the proposed method compared to NRGA and NSGA-II methods.


Author(s):  
Fengshi Jing ◽  
Qingpeng Zhang ◽  
Jason J. Ong ◽  
Yewei Xie ◽  
Yuxin Ni ◽  
...  

Human immunodeficiency virus self-testing (HIVST) is an innovative and effective strategy important to the expansion of HIV testing coverage. Several innovative implementations of HIVST have been developed and piloted among some HIV high-risk populations like men who have sex with men (MSM) to meet the global testing target. One innovative strategy is the secondary distribution of HIVST, in which individuals (defined as indexes) were given multiple testing kits for both self-use (i.e.self-testing) and distribution to other people in their MSM social network (defined as alters). Studies about secondary HIVST distribution have mainly concentrated on developing new intervention approaches to further increase the effectiveness of this relatively new strategy from the perspective of traditional public health discipline. There are many points of HIVST secondary distribution in which mathematical modelling can play an important role. In this study, we considered secondary HIVST kits distribution in a resource-constrained situation and proposed two data-driven integer linear programming models to maximize the overall economic benefits of secondary HIVST kits distribution based on our present implementation data from Chinese MSM. The objective function took expansion of normal alters and detection of positive and newly-tested ‘alters’ into account. Based on solutions from solvers, we developed greedy algorithms to find final solutions for our linear programming models. Results showed that our proposed data-driven approach could improve the total health economic benefit of HIVST secondary distribution. This article is part of the theme issue ‘Data science approaches to infectious disease surveillance’.


2021 ◽  
Author(s):  
Zhuoer Xu ◽  
Guanghui Zhu ◽  
Chunfeng Yuan ◽  
Yihua Huang

AbstractDecision trees have favorable properties, including interpretability, high computational efficiency, and the ability to learn from little training data. Learning a decision tree is known to be NP-complete. The researchers have proposed many greedy algorithms such as CART to learn approximate solutions. Inspired by the current popular neural networks, soft trees that support end-to-end training with back-propagation have attracted more and more attention. However, existing soft trees either lose the interpretability due to the continuous relaxation or employ the two-stage method of end-to-end building and then pruning. In this paper, we propose One-Stage Tree to build and prune the decision tree jointly through a bilevel optimization problem. Moreover, we leverage the reparameterization trick and proximal iterations to keep the tree discrete during end-to-end training. As a result, One-Stage Tree reduces the performance gap between training and testing and maintains the advantage of interpretability. Extensive experiments demonstrate that the proposed One-Stage Tree outperforms CART and the existing soft trees on classification and regression tasks.


Author(s):  
Marcin Jurkiewicz

AbstractWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.


Sign in / Sign up

Export Citation Format

Share Document