Finding optimum branchings
From MaRDI portal
Publication:4158841
DOI10.1002/NET.3230070103zbMath0379.90100OpenAlexW1988615825MaRDI QIDQ4158841
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070103
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (56)
Maximal dynamic polymatroid flows and applications ⋮ Polyhedral proof methods in combinatorial optimization ⋮ Efficient algorithms for finding minimum spanning trees in undirected and directed graphs ⋮ Most and least uniform spanning trees ⋮ A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships ⋮ Greedy can beat pure dynamic programming ⋮ Compression of finite-state automata through failure transitions ⋮ How to Sort by Walking on a Tree ⋮ Dispersal routes reconstruction and the minimum cost arborescence problem ⋮ Approximate maximum weight branchings ⋮ Combinatorial algorithms for DNA sequence assembly ⋮ An exact algorithm for the capacitated shortest spanning arborescence ⋮ Directed Steiner trees with diffusion costs ⋮ Unnamed Item ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ On some multicriteria arborescence problems: Complexity and algorithms ⋮ A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks ⋮ On the complexity of some arborescences finding problems on a multishop radio network ⋮ How to sort by walking and swapping on paths and trees ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Learning extended tree augmented naive structures ⋮ Ranking arborescences in O(Km log n) time ⋮ Arborescence optimization problems solvable by Edmonds' algorithm ⋮ On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Algorithm for sequential construction of spanning minimal directed forests ⋮ 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 ⋮ Unnamed Item ⋮ Inferring (biological) signal transduction networks via transitive reductions of directed graphs ⋮ An additive bounding procedure for the asymmetric travelling salesman problem ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ The rectilinear Steiner arborescence problem ⋮ On finding optimal polytrees ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A dual ascent approach for steiner tree problems on a directed graph ⋮ Asymptotic behavior of eigenvalues and random updating schemes ⋮ The complexity of finding arborescences in hypergraphs ⋮ APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM ⋮ The weighted arborescence constraint ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ Complexity of some inverse shortest path lengths problems ⋮ The Min-Max Spanning Tree Problem and some extensions ⋮ Cycle contraction in oriented graphs ⋮ Minimizing total interference in asymmetric sensor networks ⋮ Use of matroid theory in operations research, circuits and systems theory ⋮ New lower bounds for the symmetric travelling salesman problem ⋮ Optimum matching forests I: Special weights ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems ⋮ Coordination problems on networks revisited: statics and dynamics ⋮ Estimating an oncogenetic tree when false negatives and positives are present ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ A multiperiod min-sum arborescence problem
Cites Work
This page was built for publication: Finding optimum branchings
