A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2008.02.014
@@ Property / DOI: 10.1016/j.dam.2008.02.014 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+OR-Library
@@ Property / describes a project that uses: OR-Library / 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.dam.2008.02.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2058433703
@@ Property / OpenAlex ID: W2058433703 / 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 @@
+An algorithm for the steiner problem in graphs
@@ Property / cites work: An algorithm for the steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean heuristics for location problems
@@ Property / cites work: Lagrangean heuristics for location problems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Local search with perturbations for the prize-collecting Steiner tree problem in graphs
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Efficient path and vertex exchange in steiner tree algorithms
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner's problem in graphs and its implications
@@ Property / cites work: Steiner's problem in graphs and its implications / rank @@
+Normal rank
@@ Property / cites work @@
+A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Non delayed relax-and-cut algorithms
@@ Property / cites work: Non delayed relax-and-cut algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Q4519136
@@ Property / cites work: Q4519136 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge exchanges in the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The node-weighted steiner tree problem
@@ Property / cites work: The node-weighted steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2008.02.014
@@ Property / DOI: 10.1016/J.DAM.2008.02.014 / rank @@
+Normal rank