arXiv (All)
open access
Accelerated Benders decomposition for bi-objective mixed integer programming
We investigate bi-objective mixed integer programming to which Benders decomposition can be applied, a widely used technique for exploiting problem structures in real-world applications. Our study focuses on a sustainable supply chain network design problem that aims to minimise both economic and en
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
- Integer Programming and Combinatorial Optimization#3580
- Multi-objective optimisation applied to industrial energy problems#456707
- Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions#1201924
- Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty#1077407
- Exact Optimal Transport by Matching#1199359
Record · ID 1199344
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