A note on finding optimum branchings
From MaRDI portal
Publication:3867580
DOI10.1002/net.3230090403zbMath0429.90076OpenAlexW2096389124MaRDI QIDQ3867580
Luigi Fratta, Francesco Maffioli, Paolo M. Camerini
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090403
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Directed graphs (digraphs), tournaments (05C20)
Related Items (20)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs ⋮ Most and least uniform spanning trees ⋮ Approximate maximum weight branchings ⋮ Combinatorial algorithms for DNA sequence assembly ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ On some multicriteria arborescence problems: Complexity and algorithms ⋮ On the complexity of some arborescences finding problems on a multishop radio network ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Learning extended tree augmented naive structures ⋮ Arborescence optimization problems solvable by Edmonds' algorithm ⋮ An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Unnamed Item ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems ⋮ Heuristics from Nature for Hard Combinatorial Optimization Problems ⋮ An additive bounding procedure for the asymmetric travelling salesman problem ⋮ On finding optimal polytrees ⋮ APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM ⋮ Use of matroid theory in operations research, circuits and systems theory ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Cites Work
This page was built for publication: A note on finding optimum branchings
