✦ LIBER ✦

A Heuristic for Moment-Matching Scenario Generation

✍ Scribed by Kjetil Høyland; Michal Kaut; Stein W. Wallace

Book ID: 110411941
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 126 KB
Volume: 24
Category: Article
ISSN: 0926-6003
DOI: 10.1023/a:1021853807313

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Scenario Generation Method with Hetero

A Scenario Generation Method with Heteroskedasticity and Moment Matching

✍ Deniz, Erhan; Luxhøj, James T. 📂 Article 📅 2011 🏛 Taylor and Francis Group 🌐 English ⚖ 421 KB

Generating Moment Matching Scenarios Usi

Generating Moment Matching Scenarios Using Optimization Techniques

✍ Mehrotra, Sanjay; Papp, Dávid 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 877 KB

Scenario tree generation approaches usin

Scenario tree generation approaches using K-means and LP moment matching methods

✍ Daobao Xu; Zhiping Chen; Li Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 414 KB

On a Greedy Heuristic for Complete Match

On a Greedy Heuristic for Complete Matching

✍ Reingold, Edward M.; Tarjan, Robert E. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 533 KB

THE FIRST FOUR MOMENTS OF A GENERAL MATC

THE FIRST FOUR MOMENTS OF A GENERAL MATCHING PROBLEM

✍ GREENWOOD, JOSEPH A. 📂 Article 📅 1940 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 147 KB

Heuristic enhancements of the search for

Heuristic enhancements of the search for the generation of all perfect matchings

✍ M.M. Balakrishnarajan; P. Venuvanalingam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 313 KB

A search based algorithm has been introduced by us [1] to generate all perfect matchings on a graph. This paper presents a modified search that employs novel heuristics for rapid generation. This is done by an intelligent selection of edges for generating the branch nodes of the associated semantic