Stochastic maximum weight forest problem

DOI10.1002/NET.21610MaRDI QIDQ4565761zbMATH OpenOpenAlexFDO

Authors Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser

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

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

Recommendations

• A class of heuristics for the constrained forest problem
• A heuristic algorithm for the mini-max spanning forest problem
• Another greedy heuristic for the constrained forest problem
• A greedy heuristic for a minimum-weight forest problem
• Matroids and a forest cover problem

Cited in

(7)

• Degree-constrained \(k\)-minimum spanning tree problem
• Robust recoverable and two-stage selection problems
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• New formulations for the elementary shortest-path problem visiting a given set of nodes
• scientific article; zbMATH DE number 1537528 (Why is no real title available?)
• Stochastic Search in a Forest Revisited
• Network reliability: Heading out on the highway

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

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