Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem

DOI10.1016/j.endm.2011.05.054zbMath1268.90071OpenAlexW1975821973MaRDI QIDQ2840729

Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus

Publication date: 23 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.2011.05.054

zbMATH Keywords

column generationcombinatorial optimizationhop-constrained trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem

Cites Work

• Unnamed Item
• Multicommodity flow models for spanning trees with hop constraints
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks

This page was built for publication: Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem