Follow
Aleksandr M. Kazachkov
Aleksandr M. Kazachkov
Assistant Professor of Industrial & Systems Engineering, University of Florida
Verified email at ufl.edu - Homepage
Title
Cited by
Cited by
Year
How to make envy vanish over time
G Benade, AM Kazachkov, AD Procaccia, CA Psomas
Proceedings of the 2018 ACM Conference on Economics and Computation, 593-610, 2018
582018
Guessing preferences: A new approach to multi-attribute ranking and selection
PI Frazier, AM Kazachkov
Proceedings of the 2011 Winter Simulation Conference (WSC), 4319-4331, 2011
232011
The machine learning for combinatorial optimization competition (ml4co): Results and insights
M Gasse, S Bowly, Q Cappart, J Charfreitag, L Charlin, D Chételat, ...
NeurIPS 2021 competitions and demonstrations track, 220-231, 2022
202022
Envy-free division of sellable goods
J Karp, A Kazachkov, A Procaccia
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
102014
Cutting plane generation through sparse principal component analysis
SS Dey, A Kazachkov, A Lodi, G Munoz
SIAM Journal on Optimization 32 (2), 1319-1343, 2022
92022
Non-recursive cut generation
AM Kazachkov
Ph. D. thesis, Carnegie Mellon University, 2018
92018
Small representations of big kidney exchange graphs
J Dickerson, A Kazachkov, A Procaccia, T Sandholm
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
92017
On tanking and competitive balance: Reconciling conflicting incentives
AE Kazachkov, S Vardi
Manuscript. https://akazachk. github. io/pubs/tanking. pdf, 2020
82020
Fair and efficient online allocations
G Benadè, AM Kazachkov, AD Procaccia, A Psomas, D Zeng
Operations Research, 2023
32023
An abstract model for branch and cut
AM Kazachkov, P Le Bodic, S Sankaranarayanan
Mathematical Programming, 1-28, 2023
22023
Partial hyperplane activation for generalized intersection cuts
AM Kazachkov, S Nadarajah, E Balas, F Margot
Mathematical Programming Computation 12 (1), 69-107, 2020
22020
Monoidal cut strengthening
AM Kazachkov, F Serrano
Encyclopedia of Optimization. Springer, US, Boston, MA. Under review, 0
2
Monoidal strengthening of simple -polyhedral disjunctive cuts
AM Kazachkov, E Balas
arXiv preprint arXiv:2303.00237, 2023
1*2023
-Polyhedral Disjunctive Cuts
E Balas, AM Kazachkov
arXiv preprint arXiv:2207.13619, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–14