Pages that link to "Item:Q2424799"

The following pages link to Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799):

Displaying 7 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)
• On the minimum routing cost clustered tree problem (Q2359809) (← links)
• Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
• The shortest path with at most / nodes in each of the series/parallel clusters (Q4894863) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
• The multicolored graph realization problem (Q6558680) (← links)