A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2004.09.017
@@ Property / DOI: 10.1016/j.cor.2004.09.017 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2004.09.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2026880805
@@ Property / OpenAlex ID: W2026880805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem: II. Polyhedral results
+Normal rank
@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Local search with perturbations for the prize-collecting Steiner tree problem in graphs
+Normal rank
@@ Property / cites work @@
+An SST-based algorithm for the steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+The volume algorithm: Producing primal solutions with a subgradient method
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs with Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
+Normal rank
@@ Property / cites work @@
+Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2004.09.017
@@ Property / DOI: 10.1016/J.COR.2004.09.017 / rank @@
+Normal rank