On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

DOI10.1007/978-3-642-32147-4_19zbMath1370.90216OpenAlexW2108707332WikidataQ57705368 ScholiaQ57705368MaRDI QIDQ3167625

Luís Gouveia, Markus Leitner, Ivana Ljubić

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_19

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Hop constrained Steiner trees with multiple root nodes

This page was built for publication: On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes