Aleksandr M. Kazachkov

This website is in progress. In the meantime, you can find more information about me and my recent research on my CV. Please feel free to contact me at my email address if you have any questions about my work.

Older news: In 2014, I founded the INFORMS Student Chapter at CMU. Visit the CMU INFORMS site or join the mailing list for more information and details about past/upcoming talks in our student seminar.


My research focuses on methodology and applications for discrete optimization problems. In particular, I work on developing new cutting plane techniques as well as better models and algorithms for computational social choice applications such as kidney exchange markets and the fair division of indivisible goods.

Cutting plane methods

Partial Hyperplane Activation for Generalized Intersection Cuts
With E. Balas, F. Margot, and S. Nadarajah. Submitted.

V-Polyhedral Cuts
Working paper.

Cutting Planes by Tilting
Working paper.

  • Appeared as a poster, Cutting planes by tilting, at the Mixed Integer Programming Workshop in 2016, where it won an Honorable Mention in the poster competition.

Computational social choice

How to Make Envy Vanish Over Time
With G. Benadè, A. Procaccia, and C.-A. Psomas. Submitted, Feb. 2018.

Small Representations of Big Kidney Exchange Graphs
With J.P. Dickerson, A. Procaccia, and T. Sandholm. AAAI Conference on Artificial Intelligence, 2017.

  • Previously presented at EXPLORE 2016 at AAMAS 2016, where it was awarded Most Visionary Paper.

Envy-Free Division of Sellable Goods
With J. Karp and A. Procaccia. AAAI Conference on Artificial Intelligence, 2014.

Stochastic optimization

Guessing Preferences: A New Approach to Multi-Attribute Ranking and Selection
With P. Frazier. Winter Simulation Conference, 2011.

Assorted Seminars