On the hop constrained Steiner tree problem with multiple root nodes

DOI10.1007/978-3-642-32147-4_19MaRDI QIDQ3167625zbMATH OpenOpenAlexWikidataFDO

Authors Luis 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

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

Recommendations

• Hop constrained Steiner trees with multiple root nodes
• The Steiner tree problem with hop constraints
• Multicommodity flow models for spanning trees with hop constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem

Cited in

(18)

• Multicommodity flow models for spanning trees with hop constraints
• The Steiner tree problem with hop constraints
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• Optimal Steiner trees under node and edge privacy conflicts
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• Hop constrained Steiner trees with multiple root nodes
• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
• Hop-level flow formulation for the hop constrained survivable network design problem
• On solving the rooted delay- and delay-variation-constrained Steiner tree problem
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Stabilizing branch-and-price for constrained tree problems
• On Hop-Constrained Steiner Trees in Tree-Like Metrics
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
• A hop constrained min-sum arborescence with outage costs

This page was built for publication: On the hop constrained Steiner tree problem with multiple root nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167625)