1 citations · 1 across the 4 of their papers we have counts for
4 papers
Computational Framework for Bézier Distributions
Esteban Leiva, Andrés L. Medaglia, Luis F. Zuluaga
Flexible continuous univariate distributions with bounded support are essential for accurate input modeling in stochastic simulation and decision analysis. Although Bézier distribu…
Degree Bounds for Positivstellensätze of general semialgebraic sets
Olga Heijmans-Kuryatnikova, Juan C. Vera, Luis F. Zuluaga
Let denote the minimum of a polynomial over a (general) compact semialgebraic set . A standard way to approximate is via hierarc…
Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
Adrian Harkness, Hamidreza Validi, Ramin Fakhimi +4
Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this…
Characterization of QUBO reformulations for the maximum -colorable subgraph problem
Rodolfo Quintero, David Bernal, Tamás Terlaky +1
Quantum devices can be used to solve constrained combinatorial optimization (COPT) problems thanks to the use of penalization methods to embed the COPT problem's constraints in its…