Shamisa Shoja
PhD student
Presentation
Publications
Shamisa Shoja, 
On Complexity Certification of Branch-and-Bound Methods for MILP and MIQP with Applications to Hybrid MPC, Linköping Studies in Science and Technology. Licentiate Thesis 1967, Linköping University Electronic Press, Linköping (2023) 
https://doi.org/10.3384/9789180752718
Shamisa Shoja, Daniel Axehill, Exact Complexity Certification of Start Heuristics in Branch-and-Bound Methods for Mixed-Integer Linear Programming, 2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, IEEE Conference on Decision and Control, pp. 2292-2299, IEEE (2023) https://doi.org/10.1109/CDC49753.2023.10384105
Shamisa Shoja, Daniel Axehill, Exact Complexity Certification of Suboptimal Branch-and-Bound Algorithms for Mixed-Integer Linear Programming, IFAC PAPERSONLINE, pp. 7428-7435, ELSEVIER (2023) https://doi.org/10.1016/j.ifacol.2023.10.624
Shamisa Shoja, Daniel Arnström, Daniel Axehill, Exact Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Linear Programming, Proceedings of 2022 Conference on Decision and Control (CDC), IEEE Conference on Decision and Control, pp. 6298-6305, Institute of Electrical and Electronics Engineers (IEEE) (2022) https://doi.org/10.1109/CDC51059.2022.9992451
Shamisa Shoja, Daniel Arnström, Daniel Axehill, Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming, 2022 AMERICAN CONTROL CONFERENCE (ACC), pp. 4957-4964, IEEE, Atlanta, GA, USA (2022) https://doi.org/10.23919/ACC53348.2022.9867176