Seguir
Aleksandr M. Kazachkov
Aleksandr M. Kazachkov
Assistant Professor of Industrial & Systems Engineering, University of Florida
Dirección de correo verificada de ufl.edu - Página principal
Título
Citado por
Citado por
Año
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
662018
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
252022
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
UnitCommitment. jl: A Julia/JuMP optimization package for security-constrained unit commitment (version 0.3)
AS Xavier, AM Kazachkov, O Yurdakul, F Qiu
JuMP Optimization Package for Security-Constrained Unit Commitment (Version …, 2022
18*2022
Cutting plane generation through sparse principal component analysis
SS Dey, AM Kazachkov, A Lodi, G Munoz
SIAM Journal on Optimization 32 (2), 1319-1343, 2022
132022
Envy-free division of sellable goods
J Karp, AM Kazachkov, AD Procaccia
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
122014
Small representations of big kidney exchange graphs
JP Dickerson, AM Kazachkov, A Procaccia, T Sandholm
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
102017
On tanking and competitive balance: Reconciling conflicting incentives
AM Kazachkov, S Vardi
Manuscript. https://akazachk.github.io/pubs/tanking.pdf, 2020
92020
Non-recursive cut generation
AM Kazachkov
Ph. D. thesis, Carnegie Mellon University, 2018
92018
Fair and efficient online allocations
G Benadè, AM Kazachkov, AD Procaccia, A Psomas, D Zeng
Operations Research 72 (4), 1438-1452, 2024
82024
An abstract model for branch and cut
AM Kazachkov, P Le Bodic, S Sankaranarayanan
Mathematical Programming 206 (1), 175-202, 2024
32024
Monoidal strengthening of simple -polyhedral disjunctive cuts
AM Kazachkov, E Balas
arXiv preprint arXiv:2303.00237, 2023
2*2023
Monoidal Strengthening
AM Kazachkov, F Serrano
Encyclopedia of Optimization, 1-8, 2022
2*2022
Partial hyperplane activation for generalized intersection cuts
AM Kazachkov, S Nadarajah, E Balas, F Margot
Mathematical Programming Computation 12 (1), 69-107, 2020
22020
-Polyhedral Disjunctive Cuts
E Balas, AM Kazachkov
arXiv preprint arXiv:2207.13619, 2022
12022
Machine Learning for Optimization-Based Separation: the Case of Mixed-Integer Rounding Cuts
O Guaje, A Deza, AM Kazachkov, EB Khalil
arXiv preprint arXiv:2408.08449, 2024
2024
Symmetrically Fair Allocations of Indivisible Goods
C Johnston, AM Kazachkov
arXiv preprint arXiv:2406.13824, 2024
2024
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–17