On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901): Difference between revisions

@@ Property / DOI @@
-.1007/s10559-011-9319-1
@@ Property / DOI: 10.1007/s10559-011-9319-1 / rank @@
-Normal rank
@@ Property / author @@
-Victor A. Mikhailyuk
@@ Property / author: Victor A. Mikhailyuk / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6362568
@@ Property / zbMATH DE Number: 6362568 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reoptimization
@@ Property / zbMATH Keywords: reoptimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(r\)-approximation algorithm
@@ Property / zbMATH Keywords: \(r\)-approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial-time approximation scheme
@@ Property / zbMATH Keywords: polynomial-time approximation scheme / rank @@
+Normal rank
@@ Property / author @@
+Victor A. Mikhailyuk
@@ Property / author: Victor A. Mikhailyuk / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-011-9319-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2027146650
@@ Property / OpenAlex ID: W2027146650 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
+Normal rank
@@ Property / cites work @@
+Q2867366
@@ Property / cites work: Q2867366 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimizing the traveling salesman problem
@@ Property / cites work: Reoptimizing the traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / DOI @@
+.1007/S10559-011-9319-1
@@ Property / DOI: 10.1007/S10559-011-9319-1 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:464901