scientific article; zbMATH DE number 1795716

MaRDI QIDQ4550765zbMATH OpenFDO

Authors Rainer Feldmann, Norbert Sensen, Burkhard Monien, Oliver Schlake

Publication date 2002

zbMATH Keywords

NP-completeoptimization algorithms\#P-completeconsistency analysisscenario management

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Identification of a small reliable and efficient set of consistent scenarios
• Consistency of the scenario approach
• Timed scenarios: consistency, equivalence and optimization
• Scenario analysis via bundle decomposition
• Reduction of complexity in scenario analysis by means of dynamic fuzzy data analysis

Cited in

(1)

• Identification of a small reliable and efficient set of consistent scenarios

This page was built for publication:

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