HAL (France)
open access
On tractability, complexity, and mixed-integer convex programming representability of distributionally favorable optimization
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
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1161031
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1157479
- Acceleration for Affine-coupling problems#1132198
- Modified Polyhedral Method to Elicit Shape-Free Utility and Reduction of Conservatism in Robust Optimization#1326099
- Optimization over covariance matrices with a parameterized metric#1123481
Record · ID 1235614
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