Lagrangian-based column generation for the node capacitated in-tree packing problem

DOI10.15807/JORSJ.54.219MaRDI QIDQ3144760zbMATH OpenOpenAlexFDO

Authors Yuma Tanaka, Shinji Imahori, Mutsunori Yagiura

Publication date 8 December 2012

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.54.219

zbMATH Keywords

column generationcombinatorial optimizationLagrangian relaxationLP relaxationsensor network

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An LP-based heuristic algorithm 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

Cited in

(2)

• An LP-based heuristic algorithm for the node capacitated in-tree packing problem
• The complexity of the node capacitated in-tree packing problem

This page was built for publication: Lagrangian-based column generation 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 Q3144760)