Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Annette M. C. Ficker is active.

Publication


Featured researches published by Annette M. C. Ficker.


integer programming and combinatorial optimization | 2016

Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over

Erik Lambrechts; Annette M. C. Ficker; Dries Goossens; Frits C. R. Spieksma

The Circle Method is widely used in the field of sport scheduling to generate schedules for round-robini¾źtournaments. The so-called carry-over effect value is a number that can be associated to each round-robin schedule; it represents a degree of balance of a schedule. Here, we prove that, for an even number of teams, the Circle Method generates a schedule with maximum carry-over effect value, answering an open question.


workshop on approximation and online algorithms | 2016

Balanced optimization with vector costs

Annette M. C. Ficker; Frits C. R. Spieksma; Gerhard J. Woeginger

We consider so-called balanced optimization problems with vector costs. We propose a framework containing such problems; this framework allows us to investigate the complexity and approximability of these problems in a general setting. More concrete, each problem in the framework admits a 2-approximation, and for many problems within the framework this result is best-possible, in the sense that having a polynomial-time algorithm with a performance ratio better than 2 would imply P=NP. Special attention is paid to the balanced assignment problem with vector costs: we show that the problem remains NP-hard even in case of sum costs.


Omega-international Journal of Management Science | 2017

Conference scheduling - a personalized approach

Bart Vangerven; Annette M. C. Ficker; Dries Goossens; Ward Passchyn; Frits C. R. Spieksma; Gerhard J. Woeginger


Mathematical Programming | 2018

Round-robin tournaments generated by the Circle Method have maximum carry-over

Erik Lambrechts; Annette M. C. Ficker; Dries Goossens; Frits C. R. Spieksma


EURO Journal on Computational Optimization | 2018

Robust balanced optimization

Annette M. C. Ficker; Frits C. R. Spieksma; Gerhard J. Woeginger


arXiv: Data Structures and Algorithms | 2018

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.

Annette M. C. Ficker; Thomas Erlebach; Matúš Mihalák; Frits C. R. Spieksma


Annals of Operations Research | 2018

The transportation problem with conflicts

Annette M. C. Ficker; Frits C. R. Spieksma; Gerhard J. Woeginger


workshop on approximation and online algorithms | 2017

Balanced vector optimization

Annette M. C. Ficker; Frits C. R. Spieksma; Gerhard J. Woeginger


INFORMS Annual Meeting, Abstracts | 2017

Round-robin tournaments generated with the circle method have maximum carry-over

Dries Goossens; Frits C. R. Spieksma; Annette M. C. Ficker; Erik Lambrechts


6th International Conference on Mathematics in Sport, Abstracts | 2017

The Circle Method maximizes Carry-over

Erik Lambrechts; Annette M. C. Ficker; Frits C. R. Spieksma; Dries Goossens

Collaboration


Dive into the Annette M. C. Ficker's collaboration.

Top Co-Authors

Avatar

Frits C. R. Spieksma

Katholieke Universiteit Leuven

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Erik Lambrechts

Katholieke Universiteit Leuven

View shared research outputs
Top Co-Authors

Avatar

Bart Vangerven

Katholieke Universiteit Leuven

View shared research outputs
Top Co-Authors

Avatar

Ward Passchyn

Katholieke Universiteit Leuven

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge