Filters








3,978 Hits in 8.3 sec

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems [article]

Samir Khuller, Manish Purohit, Kanthi Sarpatwar
2013 arXiv   pre-print
We study partial and budgeted versions of the well studied connected dominating set problem.  ...  374-387, 1998) for the connected dominating set problem.  ...  Acknowledgment: The first author would like to thank Yossi Azar for useful discussions, held during the Dagstuhl seminar on Scheduling (2013), about the failure of prior methods for the budgeted Cds problem  ... 
arXiv:1311.2309v1 fatcat:w7s5olo3yzhhpcjlacowycfd5i

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems [chapter]

Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
We study partial and budgeted versions of the well studied connected dominating set problem.  ...  -387, 1998) for the connected dominating set problem.  ...  Acknowledgment: The first author would like to thank Yossi Azar for useful discussions, held during the Dagstuhl seminar on Scheduling (2013), about the failure of prior methods for the budgeted Cds problem  ... 
doi:10.1137/1.9781611973402.123 dblp:conf/soda/KhullerPS14 fatcat:6twb23zswjaqlpsoirg7u4z3xi

Hybridizing Large Neighborhood Search and Exact Methods for Generalized Vehicle Routing Problems with Time Windows (Revision 2)

Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Olivier Péton
2021 EURO Journal on Transportation and Logistics  
and Toffolo et al. (2019) use the BS neighborhood in a structural decomposition approach for the capacitated vehicle routing problem.  ...  For example, Moccia et al. (2012) embed a dynamic-programming component in a tabu search for the GVRPTW, Tellez et al. (2018) solve a set-partitioning problem in an LNS for a rich dial-a-ride problem,  ...  Acknowledgement We thank the anonymous reviewers and the editor whose comments and suggestions helped us to improve the manuscript.  ... 
doi:10.1016/j.ejtl.2021.100040 fatcat:5fj2fad2hfa6pe5girwlldcbru

Multi-Objective Model and Variable Neighborhood Search Algorithms for the Joint Maintenance Scheduling and Workforce Routing Problem

Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt
2022 Mathematics  
New general variable neighborhood search (GVNS) and variable neighborhood descent (VND) algorithms based on the Pareto dominance concept are proposed and performed over newly generated instances.  ...  This problem requires determining for each technician the sequence of maintenance operations to perform to minimize the total expected costs while ensuring a high level of machine availability.  ...  Acknowledgments: Acknowledgments are addressed to the Centre National pour la Recherche  ... 
doi:10.3390/math10111807 fatcat:m446t3iqhrfhzkygi3aivvdndq

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign

Vitor N. Coelho, Thays A. Oliveira, Igor M. Coelho, Bruno N. Coelho, Peter J. Fleming, Frederico G. Guimarães, Helena Ramalhinho, Marcone J.F. Souza, El-Ghazali Talbi, Thibaut Lust
2017 Computers & Operations Research  
Sets of non-dominated solutions obtained by the proposed method are described and analyzed for a number of problem instances. promotion campaign profit and the risk-adjusted return (reward-to-variability  ...  Lust, Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, Computers and Operation Research, http://dx.  ...  Helena Ramalhinho was also partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT).  ... 
doi:10.1016/j.cor.2016.09.008 fatcat:inziyotwkbbxzeur6ssifx4c6y

Dominance, epsilon, and hypervolume local optimal sets in multi-objective optimization, and how to tell the difference

Arnaud Liefooghe, Manuel López-Ibáñez, Luís Paquete, Sébastien Verel
2018 Proceedings of the Genetic and Evolutionary Computation Conference on - GECCO '18  
Local search algorithms have shown good performance for several multi-objective combinatorial optimization problems.  ...  These approaches naturally stop at a local optimal set (LO-set) under given definitions of neighborhood and preference relation among subsets of solutions, such as set-based dominance relation, hypervolume  ...  This work benefited from the COST action "Improving applicability of nature-inspired optimization by joining theory and practice" (ImAppNIO, CA15140, European Cooperation in Science and Technology).  ... 
doi:10.1145/3205455.3205572 dblp:conf/gecco/Liefooghe0PV18 fatcat:wyghxidqb5bx3lsolyzh5zslry

Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes

Fabio Daolio, Arnaud Liefooghe, Sébastien Verel, Hernán Aguirre, Kiyoshi Tanaka
2017 Evolutionary Computation  
Our analysis reveals further insights into the importance of ruggedness and multi-modality to characterize instance hardness for this family of multi-objective optimization problems and algorithms.  ...  In this paper, we attempt to understand and to contrast the impact of problem features on the performance of randomized search heuristics for black-box multi-objective combinatorial optimization problems  ...  The authors are grateful to the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1162/evco_a_00193 pmid:27689467 fatcat:7lwr4sdq3fajtnni53vdkibd6a

Problem features vs. algorithm performance on rugged multi-objective combinatorial fitness landscapes

Fabio Daolio, Arnaud Liefooghe, Sébastien Verel, Hernán Aguirre, Kiyoshi Tanaka
2017 ACM SIGEVOlution  
Our analysis reveals further insights into the importance of ruggedness and multi-modality to characterize instance hardness for this family of multi-objective optimization problems and algorithms.  ...  In this paper, we attempt to understand and to contrast the impact of problem features on the performance of randomized search heuristics for black-box multi-objective combinatorial optimization problems  ...  The authors are grateful to the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1145/3066862.3066868 fatcat:74iaknghpjg7fplgvxrnpi6yeq

On Local Search for Bi-objective Knapsack Problems

Arnaud Liefooghe, Luís Paquete, José Rui Figueira
2013 Evolutionary Computation  
The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.  ...  In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight.  ...  This work was partially supported by the Portuguese Foundation for Science and Technology (PTDC/EIA-CCO/098674/2008) and the project "Connectedness and Local Search for Multiobjective Combinatorial Optimization  ... 
doi:10.1162/evco_a_00074 pmid:22385108 fatcat:kurjc2sa3ff65pcdalhxy2xcui

Enhanced Partial Dominant Pruning (EPDP) Based Broadcasting in Ad hoc Wireless Networks

Ashikur Rahman, Md. Endadul Hoque, Farzana Rahman, Sabuj Kumar Kundu, Pawel Gburzynski
2009 Journal of Networks  
In this paper, we present a heuristic broadcast algorithm dubbed EPDP, for Enhanced Partial Dominant Pruning, and demonstrate its superiority, in terms of the total number of retransmissions, over other  ...  The major goal of any broadcasting algorithm is to minimize the number of retransmissions, i.e., to accomplish the goal with the minimum amount of traffic in the network.  ...  Therefore, one solution to the optimal broadcast problem is to find a connected dominating set of the minimum size. Unfortunately, this problem is NP-hard [8] .  ... 
doi:10.4304/jnw.4.9.895-904 fatcat:ifdch7slrfh33p7lhe6ugkhzpm

The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches [chapter]

Pedro Pinacho Davidson, Christian Blum, José A. Lozano
2017 Lecture Notes in Computer Science  
This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs.  ...  Finally, the last contribution is a population-based iterated greedy metaheuristic which is applied in two different ways: (1) the metaheuristic is applied directly to each problem instance, and (2) the  ...  Acknowledgements This work was supported by project TIN2012-37930-C02-02 (Spanish Ministry for Economy and Competitiveness, FEDER funds from the European Union).  ... 
doi:10.1007/978-3-319-55453-2_14 fatcat:fxmauiqzs5fyhdbkb6b45j6ueq

On cost-aware biased respondent group selection for minority opinion survey

Wei Wang, Donghyun Kim, Matthew Tetteh, Jun Liang, Wonjun Lee
2016 Discrete Mathematics, Algorithms and Applications (DMAA)  
We introduce two polynomial time algorithms for the problem, where each of which has an approximation ratio with respect to each of the objectives when the other optimization objective is substituted with  ...  This problem has two independent optimization goals and therefore is difficult to deal with.  ...  to see how the proposed algorithm works for various dataset from different backgrounds, which we leave as a future work of those social scientists who are interested in adopting our approach.  ... 
doi:10.1142/s1793830916500610 fatcat:hqikznytjrhljbgbpamjpr42e4

Parameterized Complexity of Edge Interdiction Problems [article]

Jiong Guo, Yash Raj Shrestha
2014 arXiv   pre-print
For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an objective with opposing interests  ...  Next, we show close relation between interdiction problems and partial cover problems on bipartite graphs where the goal is not to cover all elements but to minimize/maximize the number of covered elements  ...  The corresponding partial covering problem is the so called Partial Edge Dominating set (k-PEDS) problem which is defined as follows: k-Partial Edge Dominating Set (k-PEDS) Input: A graph G = (V, E) and  ... 
arXiv:1401.2532v1 fatcat:drtos7bh75ge3mxvipz67qurdy

Global vs Local Search on Multi-objective NK-Landscapes

Fabio Daolio, Arnaud Liefooghe, Sébastien Verel, Hernán Aguirre, Kiyoshi Tanaka
2015 Proceedings of the 2015 on Genetic and Evolutionary Computation Conference - GECCO '15  
In this paper, we consider two prototypical dominance-based algorithms: a global EMO strategy using an ergodic variation operator (GSEMO) and a neighborhood-based local search heuristic (PLS).  ...  instance classes, for both chosen algorithms.  ...  Acknowledgments This work was partially supported by the Japanese-French JSPS project "Global Research on the Framework of Evolutionary Solution Search to Accelerate Innovation" (2013-2016), and by the  ... 
doi:10.1145/2739480.2754745 dblp:conf/gecco/DaolioLVAT15 fatcat:gxc5sxznznhbhm4osj7n2gdwiq

Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees

Arpan Roy, Dong Seong Kim, Kishor S. Trivedi
2012 IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)  
We cast each optimization problem into an integer programming problem which also allows us to find optimal solution even in the absence of probability assignments to the model.  ...  Existing analytical model-based security optimization strategies do not prevail for the following reasons: (i) none of these model-based methods offer a way to find optimal security solution in the absence  ...  The authors would like to thank Prof. Paulo Maciel and Prof. Dijiang Huang for their invaluable comments during structuring of the paper.  ... 
doi:10.1109/dsn.2012.6263940 dblp:conf/dsn/RoyKT12 fatcat:d5nl7c2pcrgo3j7werxg3xr5za
« Previous Showing results 1 — 15 out of 3,978 results