Finding minimum cost directed trees with demands and capacities

DOI10.1007/BF02071977zbMath0783.90035MaRDI QIDQ1179742

Choaib Bousba, Laurence A. Wolsey

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundlower boundsmulticommodity flowfixed-charge minimum-cost directed spanning treesubtree decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (4)

Robust capacitated Steiner trees and networks with uniform demands ⋮ On the edge capacitated Steiner tree problem ⋮ Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs ⋮ Developing concurrent investment plans for power generation and transmission

Cites Work

• Unnamed Item
• Packing and covering a tree by subtrees
• A dual ascent approach for steiner tree problems on a directed graph
• Solving Large-Scale Zero-One Linear Programming Problems
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• The complexity of the capacitated tree problem
• An integer linear programming approach to the steiner problem in graphs
• Topological design of centralized computer networks—formulations and algorithms
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• An algorithm for the steiner problem in graphs

This page was built for publication: Finding minimum cost directed trees with demands and capacities