Stochastic maximum weight forest problem

DOI10.1002/net.21610zbMath1390.90402OpenAlexW2012147933MaRDI QIDQ4565761

Abdel Lisser, Marc Letournel, Rafael Andrade, Pablo Adasme

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21610

zbMATH Keywords

stochastic programmingvariable neighborhood searchKruskal algorithmL-shaped decompositionpolynomial formulationcycle elimination constraintsset cover reductionstochastic maximum weight forest problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

New formulations for the elementary shortest-path problem visiting a given set of nodes ⋮ Robust recoverable and two-stage selection problems ⋮ Network reliability: Heading out on the highway ⋮ Degree-constrained \(k\)-minimum spanning tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

This page was built for publication: Stochastic maximum weight forest problem