The following pages link to David E. Bernal (Q2089879):
Displaying 7 items.
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Integer programming techniques for minor-embedding in quantum annealers (Q2110393) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (Q4972550) (← links)
- Integer programming techniques for minor-embedding in quantum annealers (Q6331309) (← links)
- Characterization of QUBO reformulations for the maximum $k$-colorable subgraph problem (Q6358858) (← links)
