366 citations · 1.4k across the 75 of their papers we have counts for
7 papers · 1 filter
Exploiting Packing Components in General-Purpose Integer Programming Solvers
Jakub Marecek
The problem of packing boxes into a large box is often a part of a larger problem. For example in furniture supply chain applications, one needs to decide what trucks to use to tra…
Power Flow as an Algebraic System
Jakub Marecek, Timothy McCoy, Martin Mevissen
Steady states of alternating-current (AC) circuits have been studied in considerable detail. In 1982, Baillieul and Byrnes derived an upper bound on the number of steady states in…
Integer-Programming Ensemble of Temporal-Relations Classifiers
Catherine Kerr, Terri Hoare, Paula Carroll +1
The extraction and understanding of temporal events and their relations are major challenges in natural language processing. Processing text on a sentence-by-sentence or expression…
Signalling and obfuscation for congestion control
Jakub Marecek, Robert Shorten, Jia Yuan Yu
We aim to reduce the social cost of congestion in many smart city applications. In our model of congestion, agents interact over limited resources after receiving signals from a ce…
Distributed Block Coordinate Descent for Minimizing Partially Separable Functions
Jakub Marecek, Peter Richtarik, Martin Takac
In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates. We analyze its comple…
Optimal Power Flow as a Polynomial Optimization Problem
Bissan Ghaddar, Jakub Marecek, Martin Mevissen
Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptot…