Pages that link to "Item:Q2424799"
From MaRDI portal
The following pages link to Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799):
Displaying 4 items.
- A multifactorial optimization paradigm for linkage tree genetic algorithm (Q2053810) (← links)
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem (Q2123564) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)