arXiv (All)
open access
Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment
Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and comp
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
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#670559
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
- QUBO Sampling for Mixed Binary Quadratic Programming without Continuous Variable Binarization#1116378
- Simulated annealing using quantum-inspired algorithms#666627
- Quantum-informed recursive optimization algorithms#1358959
Record · ID 1446983
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