Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819): Difference between revisions

@@ 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.ejor.2007.06.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2037357784
@@ Property / OpenAlex ID: W2037357784 / rank @@
+Normal rank
@@ Property / cites work @@
+A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
+Normal rank
@@ Property / cites work @@
+Using a Hop-Constrained Model to Generate Alternative Communication Network Design
+Normal rank
@@ Property / cites work @@
+Local search with perturbations for the prize-collecting Steiner tree problem in graphs
+Normal rank
@@ Property / cites work @@
+A guide to vehicle routing heuristics
@@ Property / cites work: A guide to vehicle routing heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
+Normal rank
@@ Property / cites work @@
+Steiner Tree Problems With Profits
@@ Property / cites work: Steiner Tree Problems With Profits / rank @@
+Normal rank
@@ Property / cites work @@
+Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
+Normal rank
@@ Property / cites work @@
+A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A Tabu Search Heuristic for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Packet Routing in Telecommunication Networks with Path and Flow Restrictions
+Normal rank
@@ Property / cites work @@
+A general heuristic for vehicle routing problems
@@ Property / cites work: A general heuristic for vehicle routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+A unified heuristic for a large class of vehicle routing problems with backhauls
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with hop constraints
@@ Property / cites work: The Steiner tree problem with hop constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q5395365
@@ Property / cites work: Q5395365 / rank @@
+Normal rank