#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2006

2017

- This year (3)
- Last 5 years (21)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jakub Marecek
- Comput. J.
- 2007

We present improved algorithms based on the primal-dual paradigm, where the Handbook of Approximation Algorithms and Metaheuristics, Chapman. H.-J. Böckenhauer, J. Hromkovič, S. Seibert: Stability of approximation. In: T. F. Gonzalez (ed.): Handbook of Approximation Algorithms and Metaheuristics. Handbook of Approximation Algorithms and MetaHeuristics.… (More)

- Bissan Ghaddar, Jakub Marecek, Martin Mevissen
- IEEE Transactions on Power Systems
- 2016

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 asymptotic convergence in theory. We formulate the ACOPF as a degree-two polynomial program and study two approaches to solving it via convexifications. In the first approach, we tighten… (More)

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- Annals OR
- 2012

This paper describes a branch-and-cut procedure for an extension of the bounded colouring problem, generally known as curriculum-based university course timetabling. In particular, we focus on Udine Course Timetabling [di Gaspero and Schaerf, J. Math. Model. Algorithms 5:1], which has been used in Track 3 of the 2007 International Timetabling Competition.… (More)

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- Computers & OR
- 2010

In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a… (More)

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- Annals OR
- 2010

For many problems in Scheduling and Timetabling the choice of a mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new formulation using “supernodes”. In the definition of George and McIntyre [SIAM… (More)

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 complexity under the assumption that the smooth part of the objective function is partially block separable, and show that the degree of separability directly influences the complexity.… (More)

- François Schnitzler, Alexander Artikis, +11 authors Dimitrios Gunopulos
- ECML/PKDD
- 2014

Many complex timetabling problems, such as university course timetabling [1, 2] and employee rostering [3], have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component corresponds to hard constraints such as “each student attends all events of courses of his… (More)

- Jakub Marecek, Martin Takác
- Optimization Methods and Software
- 2017

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- ArXiv
- 2007

Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a new formulation of vertex colouring using a suitable clique partition of the graph. This… (More)