Research at TiSEM

Get inspired by Economics and Business

Check out the research special of New Scientist magazine

Top Publications Research group: Operations Research

TiSEM is pleased to announce these recent (2018-2020) publications in top journals.

Badenbroek, R. & de Klerk, E. (Accepted/In Press).  Complexity analysis of a sampling-based interior point method for convex optimization.

Slot, L. & Laurent, M. (2020). Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. Mathematical Programming.

Zhen, J., de Ruiter, F.J.C.T., Roos, E., & den Hertog, D. (Accepted/In Press). Robust optimization for models with uncertain SOC and SDP constraints. INFORMS Journal on Computing.
Wissing, P., & van Dam, E. (2020). The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum. Journal of Combinatorial Theory, Series A, 173, 105232.
Pena, J.F., Vera, J.C., & Zuluaga, L.F. (2020). New characterizations of Hoffman constants for systems of linear constraints. Mathematical Programming.

Slot, L., & Laurent, M. (2020). Improved convergence analysis of Lasserre's measure -based upper bounds for polynomial minimization on compact sets. Mathematical Programming

De Klerk, E., & Laurent, M. (2020). Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Mathematical Programming.
Mukherjee, D., Borst, S., van Leeuwaarden, J., & Whiting, P. (2020). Asymptotic optimality of power-of-d load balancing in large-scale systems. Mathematics of Operations Research, 45(4), 1535-1571.

Roos, E., & den Hertog, D. (2020). Reducing conservatism in robust optimization. INFORMS Journal on Computing, 32(4), 1109-1127.

Hu, H., & Sotirov, R. (2020). On solving the quadratic shortest path problem. INFORMS Journal on Computing, 32(2), 219-233.

Xia, W., Vera, J. C., & Zuluaga, L. F. (2020). Globally solving non-convex quadratic programs via linear integer programming techniques. INFORMS Journal on Computing, 32(1), 40-56.
de Klerk, E., & Laurent, M. (2020). Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube. Mathematics of Operations Research, 45(1), 86-98.
de Klerk, E., Kuhn, D., & Postek, K. (2020). Distributionally robust optimization with polynomial densities: theory, models and algorithms. Mathematical Programming, 181, 265-296.

Balvert, M., den Hertog, D., & Hoffmann, A. L. (2019). Robust optimization of dose-volume metrics for prostate HDR-brachytherapy incorporating target- and OAR volume delineation uncertainties. INFORMS Journal on Computing, 31(1), 100-114.

de Klerk, E., & Laurent, M. (2018). Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing. Mathematics of Operations Research, 43(4), 1317-1325.

Marandi, A., & den Hertog, D. (2018). When are static and adjustable robust optimization with constraint-wise uncertainty equivalent? Mathematical Programming , 170(2), 555-568.

Zhen, J., den Hertog, D., & Sim, M. (2018). Adjustable robust optimization via Fourier-Motzkin elimination. Operations Research, 66(4), 1086-1100.

Gribling, S., de Laat, D., & Laurent, M. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming , 170(1), 5-42.

van Dam, E., Koolen, J. H., & Park, J. (2018). Partially metric association schemes with a multiplicity three. Journal of Combinatorial Theory, Series B, Graph theory, 130, 19-48.

Postek, K., Ben-Tal, A., den Hertog, D., & Melenberg, B. (2018). Robust optimization with ambiguous stochastic constraints under mean and dispersion information. Operations Research, 66(3), 814-833.

Zhen, J., & den Hertog, D. (2018). Computing the maximum volume inscribed ellipsoid of a polytopic projection. INFORMS Journal on Computing, 30(1), 31-42.