The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks

DOI10.1016/j.endm.2009.11.024zbMath1268.90009OpenAlexW1970873832MaRDI QIDQ2840531

Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.024

zbMATH Keywords

heuristicscombinatorial optimizationnetwork flowshop-constrained trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem ⋮ Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem

Cites Work

• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• Multicommodity flow models for spanning trees with hop constraints

This page was built for publication: The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks