Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem

Pereira, Dilson Lucas; Cunha, Alexandre Salles da

doi:10.1016/j.cor.2018.05.013

Cited by 1 publication

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several formulations and approaches for applications in logistics optimization that are based on acyclic layered graphs have been proposed, see, e.g., Abeledo et al (2013) Hansknecht et al (2018) . Further important examples that are typically motivated from (telecommunication) network design include limiting the transmission delay from one or more central sources (e.g., central servers) via hop-constraints ( Botton et al, 2015;De Boeck and Fortz, 2018;Diarrassouba et al, 2016;Gouveia et al, 2014;2011b;Leitner, 2016;Ljubi ć and Gollowitzer, 2013;Pereira and Salles da Cunha, 2018;Sinnl and Ljubi ć, 2016 ), or between all relevant nodes via diameter constraints 2011b ), as well as more general delay or distance constraints from one or multiple central nodes ( Ruthmair and Raidl, 2011;).…”

Section: Acyclic and General Layered Graphsmentioning

confidence: 99%

Layered graph approaches for combinatorial optimization problems

Gouveia

Leitner

Ruthmair

2019

Computers & Operations Research

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract