arXiv (OAI Expanded)
open access
A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model
Robust optimization under interval uncertainty aims to compute solutions that perform well on a range of scenarios that are described by interval-constrained costs. In this paper, we revisit a framework introduced by Ganesh, Maggs and Panigrahi in 2020 to study the robust optimization of NP-hard pro
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
- Robust Bayesian Optimization with Q-Exponential Surrogates#1117106
- Modeling the Crude Oil Scheduling Problem with Integration with Lower Level Production Optimization and Uncertainty#489403
- Sharp higher-order uncertainty principles#1156833
- Minimax Robust Designs for M-Estimated Models#1118528
- Uncertainties with low-resolution nuclear forces#670389
Record · ID 1069960
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