Linearized formulations for failure aware barter exchange

DOI10.1007/s11590-021-01778-1zbMath1491.90173OpenAlexW3181743775MaRDI QIDQ2128774

Noam Goldberg, Michael Poss

Publication date: 22 April 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01778-1

zbMATH Keywords

longest pathMILPkidney exchangeclearing algorithmsfailure aware barter exchangelayered formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Uses Software

• PrefLib
• JuMP
• GitHub

Cites Work

• Unnamed Item
• Integer programming formulations for the elementary shortest path problem
• Maximising expectation of the number of transplants in kidney exchange programmes
• Layered graph approaches for combinatorial optimization problems
• On the complexity and approximation of the maximum expected value all-or-nothing subset
• Maximum probabilistic all-or-nothing paths
• New insights on integer-programming models for the kidney exchange problem
• Robust Models for the Kidney Exchange Problem
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Linearized formulations for failure aware barter exchange