On the greedy algorithm for stochastic optimization problems

MaRDI QIDQ4363259zbMATH OpenFDO

Authors Masaaki Kijima, Akihisa Tamura

Publication date 13 November 1997

zbMATH Keywords

greedy algorithmmatroidstochastic ordersstochastic spanning tree

Mathematics Subject Classification ID

Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• On the Greedy Solution of Ordering Problems
• scientific article; zbMATH DE number 3904604
• A framework for the greedy algorithm
• On the generality of the greedy algorithm for solving matroid base problems

Cited in

(6)

• Optimization under ordinal scales: When is a greedy solution optimal?
• Stochastic analysis of greedy algorithms for the subset sum problem
• Approximation algorithm for the 2-stage stochastic matroid base problem
• scientific article; zbMATH DE number 3942929 (Why is no real title available?)
• On the Greedy Solution of Ordering Problems
• Greedy algorithms for optimizing multivariate Horner schemes

This page was built for publication: On the greedy algorithm for stochastic optimization problems

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