18 citations · 27 across the 8 of their papers we have counts for
10 papers · 1 filter
A space-indexed formulation of packing boxes into a larger box
Sam D. Allen, Edmund K. Burke, Jakub Marecek
Current integer programming solvers fail to decide whether 12 unit cubes can be packed into a 1x1x11 box within an hour using the natural relaxation of Chen/Padberg. We present an…
Mixed-Integer Path-Stable Optimisation, with Applications in Model-Predictive Control of Water Systems
Jorn Baayen, Jakub Marecek
Many systems exhibit a mixture of continuous and discrete dynamics. We consider a family of mixed-integer non-convex non-linear optimisation problems obtained in discretisations of…
On-line Non-Convex Constrained Optimization
Olivier Massicot, Jakub Marecek
Time-varying non-convex continuous-valued non-linear constrained optimization is a fundamental problem. We study conditions wherein a momentum-like regularising term allow for the…
Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions
Claudio Gambella, Jakub Marecek, Martin Mevissen
We study the projection onto the set of feasible inputs and the set of feasible solutions of a polynomial optimisation problem (POP). Our motivation is increasing the robustness of…
A Fine-Grained Variant of the Hierarchy of Lasserre
Wann-Jiun Ma, Jakub Marecek, Martin Mevissen
There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum…
Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling
Jakub Marecek, Andrew J. Parkes
In scheduling and timetabling applications, the mutual-exclusion constraint stipulates that certain pairs of tasks that cannot be executed at the same time. This corresponds to the…