Optimum branchings
From MaRDI portal
Publication:5537097
DOI10.6028/jres.071B.032zbMath0155.51204MaRDI QIDQ5537097
No author found.
Publication date: 1967
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
Popular Branchings and Their Dual Certificates, Hollow Heaps, Multi-classifiers of Small Treewidth, How to Sort by Walking on a Tree, Lehman's Theorem and the Directed Steiner Tree Problem, Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids, Unnamed Item, A generalized linear production model: A unifying model, Approximating the Spanning k-Tree Forest Problem, A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks, Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems, A Randomly Weighted Minimum Arborescence with a Random Cost Constraint, A simple derivation of edmonds' algorithm for optimum branchings, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, The b‐bibranching problem: TDI system, packing, and discrete convexity, Stronger path‐based extended formulation for the Steiner tree problem, A linear programming based approach to the Steiner tree problem with a fixed number of terminals, Branch‐and‐cut algorithms for the ‐arborescence star problem, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Precedence-constrained arborescences, Aggregation tree construction using hierarchical structures, The Minimum Spanning Tree Problem with Time Window Constraints, Partitioning into common independent sets via relaxing strongly base orderability, Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms, 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, Dual-ascent methods for large-scale multicommodity flow problems, A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem, Reconfiguration of time-respecting arborescences, Linear-size formulations for connected planar graph partitioning and political districting, Unnamed Item, Matroids and the greedy algorithm, Facets of the Stochastic Network Flow Problem, Historical note on optimum spanning arborescences, Unnamed Item, A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems, Contrasting the Spread of Misinformation in Online Social Networks, Bribery and Control in Stable Marriage, Low cost drainage networks, Models and heuristics for a minimum arborescence problem, From symmetry to asymmetry: generalizing TSP approximations by parametrization, A lower bound for the steiner tree problem in directed graphs, A note on finding optimum branchings, Cotas inferiores para el QAP-Arbol, Finding optimum branchings, Minimizing total interference in asymmetric sensor networks, Delay-constrained minimum shortest path trees and related problems, The asymmetric traveling salesman path LP has constant integrality ratio, Delay-constrained minimum shortest path trees and related problems, Opposite Elements in Clutters, Use of matroid theory in operations research, circuits and systems theory, The geometry of dimer models, Resistant Sets in the Unit Hypercube, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Coordination problems on networks revisited: statics and dynamics, Unnamed Item, Approximating Minimum Representations of Key Horn Functions, Optimal subgraphs in a weighted digraph, Polynomial algorithms for estimating network reliability, Inferring contagion patterns in social contact networks with limited infection data, Maximal dynamic polymatroid flows and applications, A graph-algorithmic approach for the study of metastability in Markov chains, Polyhedral proof methods in combinatorial optimization, Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, A branch-and-price algorithm for the ring-tree facility location problem, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, The \(p\)-arborescence star problem: formulations and exact solution approaches, Beyond Moulin mechanisms, Greedy can beat pure dynamic programming, Compression of finite-state automata through failure transitions, Mechanism design for policy routing, Random parallel algorithms for finding exact branchings, perfect matchings, and cycles, From symmetry to asymmetry: generalizing TSP approximations by parametrization, Dispersal routes reconstruction and the minimum cost arborescence problem, Exact arborescences, matchings and cycles, Fair cost-sharing methods for the minimum spanning tree game, Approximations for constructing tree-form structures using specific material with fixed length, Generalized risk-dominance and asymmetric dynamics, Matroid optimisation problems with nested non-linear monomials in the objective function, Weighting factor extensions for finite multiple objective vector minimization problems, Cumulative disease progression models for cross-sectional data: A review and comparison, Evolutionary game theory: a renaissance, Sharing the cost of multicast transmissions in wireless networks, On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree, Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders, An exact algorithm for the capacitated shortest spanning arborescence, An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph, On some multicriteria arborescence problems: Complexity and algorithms, A simple algorithm and min-max formula for the inverse arborescence problem, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints, A branch and bound algorithm for the minimax regret spanning arborescence, How to sort by walking and swapping on paths and trees, A strongly polynomial algorithm for the inverse shortest arborescence problem, Minimax regret spanning arborescences under uncertain costs, Hybrid learning of Bayesian multinets for binary classification, Robustness of minimum cost arborescences, Characterizations of adjacency on the branching polyhedron, Heuristic and exact algorithms for minimum-weight non-spanning arborescences, On the probabilistic min spanning tree problem, Learning extended tree augmented naive structures, The \(b\)-branching problem in digraphs, Arborescence optimization problems solvable by Edmonds' algorithm, On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem, Minimum incoming cost rules for arborescences, A ranking model for the greedy algorithm and discrete convexity, A distributed algorithm for directed minimum-weight spanning tree, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, New geometry-inspired relaxations and algorithms for the metric Steiner tree problem, The ellipsoid method and its consequences in combinatorial optimization, An efficient scaling algorithm for the minimum weight bibranching problem, The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be?, Minimum cost arborescences, Facets of two Steiner arborescence polyhedra, An additive bounding procedure for the asymmetric travelling salesman problem, Compressing table data with column dependency, On finding optimal polytrees, Optimal Matching Forests and Valuated Delta-Matroids, Minimum-time and minimum-triggering impulsive stabilization for multi-agent systems over finite fields, \(k\)-distinct in- and out-branchings in digraphs, A dual ascent approach for steiner tree problems on a directed graph, Improved approximation results for the minimum energy broadcasting problem, Structural properties of matroid matchings, Investigation on irreducible cost vectors in minimum cost arborescence problems, A partition-based relaxation for Steiner trees, An LP-based heuristic algorithm for the node capacitated in-tree packing problem, Improved processor bounds for parallel algorithms for weighted directed graphs, Axiomatization of the Shapley value on minimum cost spanning tree games, Cross-monotonic cost sharing methods for connected facility location games, The weighted arborescence constraint, Worst-case performance of Wong's Steiner tree heuristic, Approximation algorithms for restricted Bayesian network structures, Approximating optimum branchings in linear time, Relationship of two formulations for shortest bibranchings, Exact solution approaches for the multi-period degree constrained minimum spanning tree problem, Eisenberg-Gale markets: algorithms and game-theoretic properties, An unbounded matroid intersection polyhedron, The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields, Local unimodularity of matrix-vector pairs, Counting minimum weight arborescences, Labeling schemes for tree representation, On the core of network synthesis games, An efficient algorithm for minimum-weight bibranching, Multicommodity flow models for spanning trees with hop constraints, Recent results on approximating the Steiner tree problem and its generalizations, New lower bounds for the symmetric travelling salesman problem, Computing in combinatorial optimization, Minimum directed 1-subtree relaxation for score orienteering problem, Distributed block-diagonal approximation methods for regularized empirical risk minimization, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Acyclic Digraphs, A method for finding the maximal set in excess demand, Stochastic dynamics and Edmonds' algorithm, Directed Steiner problems with connectivity constraints, Estimating an oncogenetic tree when false negatives and positives are present, Approximate minimum directed spanning trees under congestion, A multiperiod min-sum arborescence problem, Popular branchings and their dual certificates
