Heuristic solution procedures for a mixed‐integer programming discriminant model

By Paul A. Rubin. 1990

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Cynthia Rudin
2. Berk Ustun
3. Tong Wang
4. Paul A. Rubin
5. Nadia Burkart
6. Ş. Ertekin
7. Zhi Chen
8. Lesia Semenova

Citations in the corpus

• Supersparse linear integer models for optimized medical scoring systems (2015, methodology): “Data reduction is fundamentally different from many techniques for improving the scalability of 0–1 loss minimization, such as oscillation heuristics (Rubin, 1990), decomposition (Rubin, 1997), cutting planes (Brooks, 2011) and specialized branch-and-bound algorithms (Nguyen and Sanner, 2013).”
• Methods and Models for Interpretable Linear Classification (2014, background): “Accordingly, a large body of work has focused on improving the scalability of misclassification minimization by modifying formulations [20], applying heuristics [95, 118, 4], and designing specialized algorithms [100, 96, 85].”
• Solving mixed integer classification problems by decomposition (1997, background): “differences in the objective functions of [ 27 ] and this model, the coefficient e derived in the former needs to be scaled here by”