An LP-based heuristic algorithm for the node capacitated in-tree packing problem
DOI10.1016/J.COR.2011.05.019zbMATH Open1251.90377OpenAlexW2054943987MaRDI QIDQ1762017FDOQ1762017
Authors: Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura 
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.019
Recommendations
- Lagrangian-based column generation for the node capacitated in-tree packing problem
- The complexity of the node capacitated in-tree packing problem
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Integral packing of trees and branchings
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimum branchings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Network lifetime and power assignment in ad hoc wireless networks
- Arc-disjoint in-trees in directed graphs
- On a property of n-edge-connected digraphs
- The complexity of the node capacitated in-tree packing problem
Cited In (2)
This page was built for publication: An LP-based heuristic algorithm for the node capacitated in-tree packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762017)
