The following pages link to (Q4274209):
Displaying 3 items.
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
