Metraipolis › archive › dc_e46ecbd78593
Accelerated Benders decomposition for bi-objective mixed integer programming — arXiv:2610.04070
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04070
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T13:05:04.257Z
- SHA-256 of the archived text
d9594c80856bb6a10a8412a4330d8f4c81b272a8569c4b125654fd2491492b5a- Stable URL of this page
https://metraipolis.com/documento/dc_e46ecbd78593
How to cite
Accelerated Benders decomposition for bi-objective mixed integer programming — arXiv:2610.04070 — arXiv (en), https://arxiv.org/abs/2610.04070 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e46ecbd78593 (Metraipolis archive dc_e46ecbd78593, sha256 d9594c80856bb6a10a8412a4330d8f4c81b272a8569c4b125654fd2491492b5a)
BibTeX
@misc{dce46ecbd78593,
title = {Accelerated Benders decomposition for bi-objective mixed integer programming — arXiv:2610.04070},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04070},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e46ecbd78593; sha256 d9594c80856bb6a10a8412a4330d8f4c81b272a8569c4b125654fd2491492b5a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04070. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 environmental objectives. To address the bi-objective nature, we employ the weighted sum method, which requires solving similar problems repeatedly with different weight values. To tackle this, we propose a straightforward acceleration technique that reuses Benders cuts generated in previous iterations of the weighted sum method. This approach enables the Benders decomposition master problem to be initialised with pre-generated cuts. Our computational experiments demonstrate that reusing these cuts significantly reduces computing time. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.04070 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T11:21:31.876Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).