The following pages link to (Q4178800):
Displayed 9 items.
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
- An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
- Generating cycle spaces for graphs on surfaces with small genera (Q1883618) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)