An efficient semidefinite programming relaxation for the graph partition problem

von Sotirov, Renata
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2014)

Graph bisection revisited

von Sotirov, Renata
Veröffentlicht in Paths, Pivots, and Practice: the Power of Optimization (Veranstaltung : 2015 : Montreal) Paths, pivots, and practice (2018)

On solving the quadratic shortest path problem

von Hu, Hao
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2020)

SDP-based bounds for the quadratic cycle cover problem via cutting-plane augmented Lagrangian methods and reinforcement learning

von Meijer, Frank de
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2021)

Supply chain network downsizing with product line pruning using a new demand substitution

von Ashayeri, Jalal
Veröffentlicht in Operational Research Society Journal of the Operational Research Society (2015)

The redesign of a warranty distribution network with recovery processes

von Ashayeri, Jalal
Veröffentlicht in Transportation research / E (2015)

Lower bounds for the bandwidth problem

von Rendl, Franz
Veröffentlicht in Computers & operations research (2021)

Partitioning through projections : strong SDP bounds for large graph partition problems

von Meijer, Frank de
Veröffentlicht in Computers & operations research (2023)

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems

Veröffentlicht in European journal of operational research (2014)