arXiv (All)
open access
A Framework for Handling and Exploiting Symmetry in Benders Decomposition
Benders decomposition (BD) is a framework for solving optimization problems by removing some variables and modeling their contribution to the original problem via so-called Benders cuts. While many advanced optimization techniques can be applied in a BD framework, one central technique has not been
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 Proxy Benders Decomposition#266170
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- A computational comparison of handling distance constraints in MINLP#1166167
- Chain rule symmetry for singular SPDEs from multi-indices to decorated trees#984582
- Solving combinatorial optimization problems by hybrid methods combining machine learning techniques with existing optimization techniques#337528
Record · ID 1156236
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