A note on finding optimum branchings
From MaRDI portal
Publication:3867580
DOI10.1002/net.3230090403zbMath0429.90076MaRDI QIDQ3867580
Francesco Maffioli, Paolo M. Camerini, Luigi Fratta
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090403
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
05C20: Directed graphs (digraphs), tournaments
Related Items
Approximating the Spanning k-Tree Forest Problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, Approximate maximum weight branchings, Minimax regret spanning arborescences under uncertain costs, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Most and least uniform spanning trees, On the complexity of some arborescences finding problems on a multishop radio network, An additive bounding procedure for the asymmetric travelling salesman problem, Arborescence optimization problems solvable by Edmonds' algorithm, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Combinatorial algorithms for DNA sequence assembly, On some multicriteria arborescence problems: Complexity and algorithms, Use of matroid theory in operations research, circuits and systems theory
Cites Work
