arXiv (All)
open access
Fused ultrametric Gromov-Wasserstein for Scenario Tree generation in Multistage Stochastic Programming
Multistage Stochastic Programming requires scenario trees that accurately approximate the unknown underlying uncertainty process without violating the non-anticipativity constraint. Most of the existing method for scenario tree generation usually target just one of the two goals at the expense of th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Unified Separation Condition: A General Constraint Qualification for Smooth and Nonsmooth Optimization#1123389
- Optimal scenario design for climate emulation#1141574
- Efficient Constant Optimization for Symbolic Regression with GPU-Accelerated Tree-Based Genetic Programming#926280
- Multi-perspective Machine Learning (MPML) — A Machine Learning Model for Multi-faceted Learning Problems#491011
- GAVEL: Graph World Models for Verified and Efficient Long-Horizon LLM Task Planning#1013912
Record · ID 1132164
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive