most citedOverall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming

1 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing eess.SYShow all

2 papers · 1 filter

eess.SY2023★ 1 cited

Exact Worst-Case Execution-Time Analysis for Implicit Model Predictive Control

Daniel Arnström, David Broman, Daniel Axehill

We propose the first method that determines the exact worst-case execution time (WCET) for implicit linear model predictive control (MPC). Such WCET bounds are imperative when MPC…

eess.SY2022★ 1 cited

Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming

Shamisa Shoja, Daniel Arnström, Daniel Axehill

This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined a…