Optimum branchings
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Labeling schemes for tree representation
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Maximal dynamic polymatroid flows and applications
- Polyhedral proof methods in combinatorial optimization
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Exact arborescences, matchings and cycles
- Weighting factor extensions for finite multiple objective vector minimization problems
- Characterizations of adjacency on the branching polyhedron
- On O(n^2) heuristic algorithm for the directed Steiner minimal tree problem
- The ellipsoid method and its consequences in combinatorial optimization
- Facets of two Steiner arborescence polyhedra
- An additive bounding procedure for the asymmetric travelling salesman problem
- Structural properties of matroid matchings
- Improved processor bounds for parallel algorithms for weighted directed graphs
- An unbounded matroid intersection polyhedron
- Local unimodularity of matrix-vector pairs
- An efficient algorithm for minimum-weight bibranching
- Multicommodity flow models for spanning trees with hop constraints
- Minimum directed 1-subtree relaxation for score orienteering problem
- Directed Steiner problems with connectivity constraints
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- Arborescence optimization problems solvable by Edmonds' algorithm
- Recent results on approximating the Steiner tree problem and its generalizations
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Estimating an oncogenetic tree when false negatives and positives are present
- The p-arborescence star problem: formulations and exact solution approaches
- Greedy can beat pure dynamic programming
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Evolutionary game theory: a renaissance
- Hybrid learning of Bayesian multinets for binary classification
- Minimum incoming cost rules for arborescences
- k-distinct in- and out-branchings in digraphs
- Investigation on irreducible cost vectors in minimum cost arborescence problems
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem
- Counting minimum weight arborescences
- New lower bounds for the symmetric travelling salesman problem
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
- An exact algorithm for the capacitated shortest spanning arborescence
- On some multicriteria arborescence problems: Complexity and algorithms
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Robustness of minimum cost arborescences
- On the probabilistic min spanning tree problem
- The weighted arborescence constraint
- Relationship of two formulations for shortest bibranchings
- Computing in combinatorial optimization
- Stochastic dynamics and Edmonds' algorithm
- Approximate minimum directed spanning trees under congestion
- Popular branchings and their dual certificates
- A branch-and-price algorithm for the ring-tree facility location problem
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- The \(b\)-branching problem in digraphs
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be?
- Minimum-time and minimum-triggering impulsive stabilization for multi-agent systems over finite fields
- A method for finding the maximal set in excess demand
- A graph-algorithmic approach for the study of metastability in Markov chains
- Mechanism design for policy routing
- How to sort by walking and swapping on paths and trees
- A ranking model for the greedy algorithm and discrete convexity
- Compressing table data with column dependency
- Improved approximation results for the minimum energy broadcasting problem
- Worst-case performance of Wong's Steiner tree heuristic
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields
- A multiperiod min-sum arborescence problem
- Dispersal routes reconstruction and the minimum cost arborescence problem
- Inferring contagion patterns in social contact networks with limited infection data
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
- A simple algorithm and min-max formula for the inverse arborescence problem
- A distributed algorithm for directed minimum-weight spanning tree
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Cumulative disease progression models for cross-sectional data: a review and comparison
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Compression of finite-state automata through failure transitions
- Optimal matching forests and valuated delta-matroids
- Acyclic digraphs
- Approximations for constructing tree-form structures using specific material with fixed length
- A dual ascent approach for steiner tree problems on a directed graph
- Cotas inferiores para el QAP-Arbol
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Hollow Heaps
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- Multi-classifiers of small treewidth
- How to sort by walking on a tree
- Lehman's theorem and the directed Steiner tree problem
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- A generalized linear production model: A unifying model
- The Minimum Spanning Tree Problem with Time Window Constraints
- A note on finding optimum branchings
- Use of matroid theory in operations research, circuits and systems theory
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Optimal subgraphs in a weighted digraph
- Polynomial algorithms for estimating network reliability
- Low cost drainage networks
- Finding optimum branchings
- Dual-ascent methods for large-scale multicommodity flow problems
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- Resistant sets in the unit hypercube
This page was built for publication: Optimum branchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537097)
