On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

DOI10.1287/OPRE.47.3.476zbMATH Open1014.90080OpenAlexW2160247430MaRDI QIDQ4545686FDOQ4545686

Authors: Sheldon H. Jacobson, Enver Yücesan 

Publication date: 17 July 2003

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.47.3.476

Recommendations

• Computational issues for accessibility in discrete event simulation
• Intractability results in discrete-event simulation
• Studying the complexity of global verification for NP-hard discrete optimization problems
• On the generality of event-graph models
• Computational Complexity of Network Reliability Analysis: An Overview

zbMATH Keywords

computational complexity theoryvarious discrete event simulation problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (3)

• Title not available (Why is that?)
• A class of convergent generalized hill climbing algorithms
• On the generality of event-graph models

This page was built for publication: On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

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