scientific article; zbMATH DE number 3614523
From MaRDI portal
Publication:4178800
zbMath0395.90077MaRDI QIDQ4178800
Fred Glover, Darwin D. Klingman
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35)
Related Items
The 2-quasi-greedy algorithm for cardinality constrained matroid bases, The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, Generating cycle spaces for graphs on surfaces with small genera, Exact arborescences, matchings and cycles, The \(k\)-path tree matroid and its applications to survivable network design, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, A note on relatives to the Held and Karp 1-tree problem, An extension of Christofides heuristic to the k-person travelling salesman problem, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
