Strengthened MIP formulations for the liver region redesign models of Akshat et al.

Author(s)
Karagoz, Aysenur; Liu, Ruofeng; Validi, Hamidreza
Download11590_2024_2179_ReferencePDF.pdf (Embargoed until: 2025-12-28, 4.470Mb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Liver transplantation has been a critical issue in the U.S. healthcare system for decades, and the region redesign aims to ameliorate this issue. This paper revisits two mixed integer programming (MIP) formulations of the liver region redesign problem proposed by Akshat et al. [1]. We study their first formulation considering two different modeling approaches: one compact formulation and one with exponentially many constraints. We also propose a set of variable fixing procedures and conduct a polyhedral study on their second formulation. Our computational results show that multiple unsolved instances are solved to optimality.
Date issued
2024-12-28
URI
https://hdl.handle.net/1721.1/159280
Department
Massachusetts Institute of Technology. Operations Research Center
Journal
Optimization Letters
Publisher
Springer Berlin Heidelberg
Citation
Karagoz, A., Liu, R. & Validi, H. Strengthened MIP formulations for the liver region redesign models of Akshat et al.. Optim Lett 19, 505–525 (2025).
Version: Author's final manuscript
Collections