Pages that link to "Item:Q1592840"
From MaRDI portal
The following pages link to Generalized Steiner problems and other variants (Q1592840):
Displayed 12 items.
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- A rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- A new relaxation method for the generalized minimum spanning tree problem (Q2575572) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)