Methodology for Stochastic Graph Completion-Time Problems

DOI10.1287/IJOC.8.4.331MaRDI QIDQ4367048zbMATH OpenOpenAlexFDO

Authors Thusitha Jayawardena, S. Yakowitz

Publication date 5 April 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.8.4.331

zbMATH Keywords

traveling salesmanstochastic shortest path\(k\)-opt heuristicsstochastic graph completion-time problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Recommendations

• A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
• Probabilistic optimization in graph-problems
• A hierarchical approach for bounding the completion time distribution of stochastic task graphs
• Approximation algorithms for stochastic combinatorial optimization problems
• Graph theoretic methods for matrix completion problems
• scientific article; zbMATH DE number 4205985
• scientific article; zbMATH DE number 1890147
• scientific article; zbMATH DE number 4101220
• scientific article; zbMATH DE number 3854438

Cited in

(3)

• scientific article; zbMATH DE number 1375600 (Why is no real title available?)
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights

This page was built for publication: Methodology for Stochastic Graph Completion-Time Problems

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