Pareto optimization for subset selection with dynamic cost constraints (Q2060721): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3200825350
@@ Property / OpenAlex ID: W3200825350 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07806
@@ Property / arXiv ID: 1811.07806 / rank @@
+Normal rank
@@ Property / cites work @@
+Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
+Normal rank
@@ Property / cites work @@
+Q2999661
@@ Property / cites work: Q2999661 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3634897
@@ Property / cites work: Q3634897 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical mechanics of complex networks
@@ Property / cites work: Statistical mechanics of complex networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Random constraint satisfaction: easy generation of hard (satisfiable) instances
+Normal rank