1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.OC2021
On the Linear Ordering Problem and the Rankability of Data
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review…
math.OC2020★ 1 cited
Diameter Polytopes of Feasible Binary Programs
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
Feasible binary programs often have multiple optimal solutions, which is of interest in applications as they allow the user to choose between alternative optima without deteriorati…