Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models

Evolutionary Computation (2010) 18 (4): 617–633.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Subset Selection for Evolutionary Multiobjective Optimization
  • Yu-Ran Gu
  • Chao Bian
  • Miqing Li
  • Chao Qian
IEEE Transactions on Evolutionary Computation (2024) 28 (2): 403.
Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio
  • Yaoyao Zhang
  • Chaojie Zhu
  • Shaojie Tang
  • Yingli Ran
  • Ding-Zhu Du
  • Zhao Zhang
INFORMS Journal on Computing (2024) 36 (2): 510.
Multiobjectivization of Single-Objective Optimization in Evolutionary Computation: A Survey
  • Xiaoliang Ma
  • Zhitao Huang
  • Xiaodong Li
  • Yutao Qi
  • Lei Wang
  • Zexuan Zhu
IEEE Transactions on Cybernetics (2023) 53 (6): 3702.
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
  • Weijie Zheng
  • Benjamin Doerr
Artificial Intelligence (2023) 325: 104016.
Toward the minimum vertex cover of complex networks using distributed potential games
  • Jie Chen
  • Xiang Li
Science China Information Sciences (2023) 66 (1)
Runtime analysis of some hybrid algorithms
  • Xinsheng Lai
  • Yuren Zhou
Neural Computing and Applications (2023) 35 (19): 14153.
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
  • Vahid Roostapour
  • Aneta Neumann
  • Frank Neumann
Theoretical Computer Science (2022) 924: 129.
On Performance of a Simple Multi-objective Evolutionary Algorithm on the Constrained Minimum Spanning Tree Problem
  • Xinsheng Lai
International Journal of Computational Intelligence Systems (2022) 15 (1)
Pareto optimization for subset selection with dynamic cost constraints
  • Vahid Roostapour
  • Aneta Neumann
  • Frank Neumann
  • Tobias Friedrich
Artificial Intelligence (2022) 302: 103597.
Finding minimum label spanning trees using cross‐entropy method
  • Radislav Vaisman
Networks (2022) 79 (2): 220.
Running Time Analysis of MOEA/D on Pseudo-Boolean Functions
  • Zhengxin Huang
  • Yuren Zhou
  • Zefeng Chen
  • Xiaoyu He
  • Xinsheng Lai
  • Xiaoyun Xia
IEEE Transactions on Cybernetics (2021) 51 (10): 5130.
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
  • Feng Shi
  • Frank Neumann
  • Jianxin Wang
Algorithmica (2021) 83 (4): 906.
Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
  • Chao Qian
Evolutionary Computation (2021) 29 (4): 463.
Trading support system for portfolio construction using wisdom of artificial crowds and evolutionary computation
  • Werner Kristjanpoller
  • Kevin Michell
  • Marcel C. Minutolo
  • Prakash Dheeriya
Expert Systems with Applications (2021) 177: 114943.
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization
  • Benjamin Doerr
  • Frank Neumann
ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.
Error analysis of elitist randomized search heuristics
  • Cong Wang
  • Yu Chen
  • Jun He
  • Chengwang Xie
Swarm and Evolutionary Computation (2021) 63: 100875.
Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem
  • Feng Shi
  • Frank Neumann
  • Jianxin Wang
Theoretical Computer Science (2021) 893: 159.
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
  • Francesco Quinzan
  • Andreas Göbel
  • Markus Wagner
  • Tobias Friedrich
Natural Computing (2021) 20 (3): 561.
Fast Immune System-Inspired Hypermutation Operators for Combinatorial Optimization
  • Dogan Corus
  • Pietro S. Oliveto
  • Donya Yazdani
IEEE Transactions on Evolutionary Computation (2021) 25 (5): 956.
Analysis of multiobjective evolutionary algorithms on the biobjective traveling salesman problem (1,2)
  • Xinsheng Lai
  • Yuren Zhou
Multimedia Tools and Applications (2020) 79 (41-42): 30839.
Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem
  • Mojgan Pourhassan
  • Vahid Roostapour
  • Frank Neumann
Theoretical Computer Science (2020) 832: 20.
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem
  • Mojgan Pourhassan
  • Feng Shi
  • Frank Neumann
Evolutionary Computation (2019) 27 (4): 559.
A Covariance Matrix Self-Adaptation Evolution Strategy for Optimization Under Linear Constraints
  • Patrick Spettel
  • Hans-Georg Beyer
  • Michael Hellwig
IEEE Transactions on Evolutionary Computation (2019) 23 (3): 514.
Approximation guarantees of evolutionary optimization on the minimum crossing spanning tree problem
  • Jianping Zhang
  • Hong Zhou
  • Huimin Gao
Cluster Computing (2019) 22 (2): 409.
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
  • Feng Shi
  • Martin Schirneck
  • Tobias Friedrich
  • Timo Kötzing
  • Frank Neumann
Algorithmica (2019) 81 (2): 828.
Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
  • Chao Qian
  • Yang Yu
  • Ke Tang
  • Xin Yao
  • Zhi-Hua Zhou
Artificial Intelligence (2019) 275: 279.
Multi-objective evolutionary computation for topology coverage assessment problem
  • Xing Zhou
  • Huaimin Wang
  • Bo Ding
  • Wei Peng
  • Rui Wang
Knowledge-Based Systems (2019) 177: 1.
Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
  • Chao Qian
  • Jing-Cheng Shi
  • Ke Tang
  • Zhi-Hua Zhou
IEEE Transactions on Evolutionary Computation (2018) 22 (4): 595.
Performance Analysis of Evolutionary Optimization for the Bank Account Location Problem
  • Xiaoyun Xia
  • Xue Peng
  • Liuyang Deng
  • Xinsheng Lai
  • Zhaolu Guo
  • Xiangjing Lai
IEEE Access (2018) 6: 17756.
Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems
  • Xinsheng Lai
  • Yuren Zhou
  • Xiaoyun Xia
  • Qingfu Zhang
Evolutionary Computation (2017) 25 (4): 707.
Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
  • Carlos Segura
  • Carlos A. Coello Coello
  • Gara Miranda
  • Coromoto León
Annals of Operations Research (2016) 240 (1): 217.
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
  • Tobias Friedrich
  • Frank Neumann
Evolutionary Computation (2015) 23 (4): 543.
Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem
  • Yuren Zhou
  • Xinsheng Lai
  • Kangshun Li
IEEE Transactions on Cybernetics (2015) 45 (8): 1491.
ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization
  • Miqing Li
  • Shengxiang Yang
  • Jinhua Zheng
  • Xiaohui Liu
Evolutionary Computation (2014) 22 (2): 189.
Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem
IEEE Transactions on Evolutionary Computation (2014) 18 (6): 860.
General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*
  • Jörg Lässig
  • Dirk Sudholt
Evolutionary Computation (2014) 22 (3): 405.
More effective crossover operators for the all-pairs shortest path problem
  • Benjamin Doerr
  • Daniel Johannsen
  • Timo Kötzing
  • Frank Neumann
  • Madeleine Theile
Theoretical Computer Science (2013) 471: 12.
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
  • Stefan Kratsch
  • Frank Neumann
Algorithmica (2013) 65 (4): 754.
On the approximation ability of evolutionary optimization with application to minimum set cover
  • Yang Yu
  • Xin Yao
  • Zhi-Hua Zhou
Artificial Intelligence (2012) 180-181: 20.

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept