Parisa Zehtabi — accepted AI-conference papers

2024

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates

Kyle Mana, Fernando Acero, Stephen Mak, Parisa Zehtabi, Michael Cashmore, Daniele Magazzeni +1

AAAI 2024technical

Discrete optimization belongs to the set of N P-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms, which reach optimal solutions by itera…

Cited by 0 Source ↗PDF ↗Scholar ↗

2022

Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction

Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Jason Long, Parisa Zehtabi, Daniele Magazzeni

AAAI 2022technical

We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by N identical servers. Each task has a price, which is a positive real number, and a class. Each class of task has a different price distri…

Cited by 6 Source ↗PDF ↗Scholar ↗