Pages that link to "Item:Q992574"
From MaRDI portal
The following pages link to An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574):
Displaying 5 items.
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116) (← links)
- Maximizing the net present value of a Steiner tree (Q2349527) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)