Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach
JBC Chagas, M Wagner - Optimization Letters, 2022 - Springer
We tackle the thief orienteering problem (ThOP), an academic multi-component problem that
combines two classical combinatorial problems, namely the Knapsack Problem and the …
combines two classical combinatorial problems, namely the Knapsack Problem and the …
Discretization and global optimization for mixed integer bilinear programming
X Cheng, X Li - Journal of Global Optimization, 2022 - Springer
We consider global optimization of mixed-integer bilinear programs (MIBLP) using
discretization-based mixed-integer linear programming (MILP) relaxations. We start from the …
discretization-based mixed-integer linear programming (MILP) relaxations. We start from the …
[图书][B] Sparse Recovery Under Side Constraints Using Null Space Properties
F Matter - 2022 - wwwopt.mathematik.tu-darmstadt.de
Zusammenfassung Ein Kernaspekt von Compressed Sensing ist die Rekonstruktion von
Signalen mithilfe von möglichst wenigen Messungen. Dies wird unter Ausnutzung der …
Signalen mithilfe von möglichst wenigen Messungen. Dies wird unter Ausnutzung der …
Handling Sub-symmetry in Integer Programming using Activation Handlers
C Hojny, T Verhoeff, S Wessel - Cologne-Twente Workshop on Graphs …, 2023 - Springer
Symmetry in integer programs (IPs) can be exploited to reduce solving times. Usually only
symmetries of the original IP are handled, but new symmetries may arise at some nodes of …
symmetries of the original IP are handled, but new symmetries may arise at some nodes of …