9 citations · 9 across the 1 of their papers we have counts for
4 papers
Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
Atithi Acharya, Romina Yalovetzky, Pierre Minssen +10
Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work…
Q-CHOP: Quantum constrained Hamiltonian optimization
Michael A. Perlin, Ruslan Shaydulin, Benjamin P. Hall +7
Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both class…
Des-q: a quantum algorithm to provably speedup retraining of decision trees
Niraj Kumar, Romina Yalovetzky, Changhao Li +2
Decision trees are widely adopted machine learning models due to their simplicity and explainability. However, as training data size grows, standard methods become increasingly slo…
Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Shouvanik Chakrabarti, Pierre Minssen, Romina Yalovetzky +1
Mixed Integer Programs (MIPs) model many optimization problems of interest in Computer Science, Operations Research, and Financial Engineering. Solving MIPs is NP-Hard in general,…