A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-B" /><55::AID-NET6>3.0.CO;2-B 10.1002/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-BzbMath0881.90119OpenAlexW1972720599MaRDI QIDQ4345574

Matteo Fischetti, Daniele Vigo

Publication date: 23 July 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199701)29:1<55::aid-net6>3.0.co;2-b

zbMATH Keywords

heuristicbranch-and-cutdesign of distribution networkminimum-weight arborescenceNP-hard extensionresource-constrained minimum-weight arborescence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05)

Related Items (4)

Precedence-constrained arborescences ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ Column generation for extended formulations ⋮ The weighted arborescence constraint

This page was built for publication: A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem