Skip to ContentSkip to Navigation
About us Latest news Press information

Sierksma, Prof. Gerard

Gerard Sierksma
Gerard Sierksma

Gerard Sierksma is professor of Quantitative Logistics at the Faculty of Economics and Business. He studied mathematics, physics and astronomy at the University of Groningen and gained his PhD in mathematics in 1976. He has been concentrating on the practical application of mathematical methods ever since. In recent years, Sierksma has been working on the development of decision support computer systems for industry and top-level sports. His research focuses mainly on the combination of science and sport. For example, Sierksma advised the KNSB (the Dutch ice-skating association) on the composition of the speed skating team for the Olympic Games in Vancouver and Sotsji. Alongside his position of professor, he also holds various other posts, including that of scientific advisor to ORTEC-TeamSupportSystems. Sierksma claims that punishing doping users in retrospect is the deathknell for sport. ‘Sport is becoming something we can’t take seriously anymore, what with all these doping scandals. Here we are cheering for winners who may have to return their medals tomorrow – or in eight years’ time. Once the medal has been awarded, the doping file should be burnt,' says Sierksma.

Sierksma has been campaigning for years for a fairer way to time skaters, for example including thousandths of seconds. At the 2013 Dutch Sprint Championships, that would probably have resulted in a different winner than Stefan Groothuis. If several different times are logged and it is not clear who has won the 500 metres in speed skating (like at the Olympics in Sochi), a skate-off should be held, says Sierksma.

Previously in the news

Article NRC Handelsblad
Article NRC Handelsblad

Publications

2020

Sierksma, G. (Accepted/In press). Buitenspel, meetfouten en millimetergemier. STAtOR, 21, 35-37.

2018

Sierksma, G. (2018). Statistiek van de sanseveria. STAtOR, 4, 39-40.

2017

Sierksma, G. (2017). Bhaiparthait en Pyeongchang: Olympische Schaatsstatistiek. STAtOR, 18(4), 32-33.
Sierksma, G. (2017). Cutting stokbrood. STAtOR, 18(3), 32-33.
Sierksma, G. (2017). Introduction: Olympics, Track & Field, part II. In J. J. Cochran, J. Bennett, & J. Albert (Eds.), The Oxford Anthology of Statistics in Sport: Volume 1: 2000-2004 (pp. 73-76). (Oxford Series On Science In Sports). Oxford: Oxford University Press.

2016

Kuper, G. H., Sierksma, G., & Spieksma, F. (2016). Tennisselectie Olympische Spelen Rio 2016: Rankings als basis voor selectieprocedures. STAtOR, 17(2), 7-12.
Sierksma, G., Talsma, B., & Turkensteen, M. (2016). The growing problem of comparing elite sport performances: The speed skating case. S892-S907. Paper presented at 11th World Congress of Performance Analysis of Sport, Alicante, Spain.

2015

Sierksma, G., & Zwols, Y. (2015). Linear and integer optimization: Theory and practice. (3 ed.) Taylor & Francis Group.

2014

Kuper, G. H., Sierksma, G., & Spieksma, F. (2014). ATP en WTA wereldranglijst als voorspeller van de kans op het bereiken van de kwartfinales in het Olympische Tennistoernooi. Rijksuniversiteit Groningen.
Kuper, G., Sierksma, G., & Spieksma, F. (2014). De wereldranglijst als voorspeller van de kans op het bereiken van de kwartfinales in het Olympische Badmintontoernooi. Rijksuniversiteit Groningen.
Kuper, G., Sierksma, G., & Spieksma, F. (2014). Using tennis rankings to predict performance in upcoming tournaments. (SOM Research Report; Vol. 14034-EEF). Groningen: University of Groningen, SOM research school.

2012

Kamst, R., Kuper, G. H., Sierksma, G., & Talsma, B. G. (2012). Inner-Outer Lane Advantage in Olympic 1000 Meter Speed Skating. Jahrbucher fur nationalokonomie und statistik, 232(3), 293-307.

2011

Turkensteen, M., Sierksma, G., & Wieringa, J. E. (2011). Balancing the fit and logistics costs of market segmentations. European Journal of Operational Research, 213(1), 340-348. https://doi.org/10.1016/j.ejor.2011.02.027

2010

Kamst, R., Kuper, G. H., & Sierksma, G. (2010). The Olympic 500-m speed skating; the inner-outer lane difference. Statistica Neerlandica, 64(4), 448 - 459. https://doi.org/10.1111/j.1467-9574.2010.00457.x
Sierksma, G., & Ghosh, D. (2010). Networks in Action. Heidelberg: Springer.
Sierksma, G., & Ghosh, D. (2010). Networks in Action: Text and Computer Exercises in Network Optimization. (International Series in Operations Research & Management Science; Vol. 140). Springer.

2009

Albdaiwi, B. F., Goldengorin, B., & Sierksma, G. (2009). Equivalent instances of the simple plant location problem. Computers & Mathematics with Applications, 57(5), 812-820. https://doi.org/10.1016/j.camwa.2008.10.081
Sierksma, G., & Zwols, Y. (2009). Training optimization for the decathlon. Operations Research, 57(4), 812-822. https://doi.org/10.1287/opre.1080.0616

2008

Turkensteen, M., Ghosh, D., Goldengorin, B., & Sierksma, G. (2008). Tolerance-based Branch and Bound algorithms for the ATSP. European Journal of Operational Research, 189(3), 775-788. https://doi.org/10.1016/j.ejor.2006.10.062
Koning, R. H., & Sierksma, G. (2008). Sport, statistiek en OR. STAtOR, 9(2), 3.

2007

Alcaide, D., Chu, C., Kats, V., Levner, E., & Sierksma, G. (2007). Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. European Journal of Operational Research, 177(1), 147-162. https://doi.org/10.1016/j.ejor.2005.11.019

2006

Turkensteen, M., Ghosh, D., Goldengorin, B., & Sierksma, G. (2006). Iterative patching and the Asymmetric Traveling Salesman Problem. Discrete Optimization, 3(1), 63-77. https://doi.org/10.1016/j.disopt.2005.10.005
Ghosh, D., Chakravarti, N., & Sierksma, G. (2006). Sensitivity analysis of a greedy heuristic for knapsack problems. European Journal of Operational Research, 169(1), 340-350. https://doi.org/10.1016/j.ejor.2004.09.025

2005

Changat, M., Mulder, HM., & Sierksma, G. (2005). Convexities related to path properties on graphs. Discrete Mathematics, 290(2-3), 117-131. https://doi.org/10.1016/j.disc.2003.07.014
Ghosh, D., Goldengorin, B., & Sierksma, G. (2005). Data correcting: a methodology for obtaining near-optimal solutions. In S. R. Mohan, & S. K. Neogy (Eds.), Operations research with economic and industrial applications: emerging trends (pp. 119 - 127). Dordrecht/Boston/London: Kluwer Academic Publishers.
Ghosh, D., Goldengorin, B., & Sierksma, G. (2005). Data correcting algorithms in combinatorial optimization. In D. Z. Du, & P. M. Pardalos (Eds.), Handbook of combinatorial optimization, 5 (pp. 1 - 53). Dordrecht/Boston/London: Kluwer Academic Publishers.
Ghosh, D., Goldengorin, B., & Sierksma, G. (2005). Tolerance-based branch and bound, algorithms. In Proceedings ORP (pp. 171 - 182)

2004

Wanders, H. L. T., Gaalman, G. J. C., & Sierksma, G. (2004). The composition of semi-finished inventories at a solid board plant. European Journal of Operational Research, 155(1), 96-111. https://doi.org/10.1016/s0377-2217(02)00853-6
Goldengorin, B., Ghosh, D., & Sierksma, G. (2004). Branch and peg algorithms for the simple plant location problem. Computers & Operations Research, 31(2), 241 - 255. https://doi.org/10.1016/S0305-0548(02)00190-9
Klooster, G., & Sierksma, G. (2004). Computeranalyses ondersteunen managers, coaches en scouts. SportGericht, 57(5/6), 9 - 12.
Turkensteen, M., Ghosh, D., Goldengorin, B., & Sierksma, G. (2004). Iterative patching and the asymmetric traveling salesman problem. (A27 ed.) Groningen: University of Groningen, SOM research school.
Goldengorin, B., Sierksma, G., & Turkensteen, M. (2004). Tolerance based algorithms for the ATSP. Lecture Notes in Computer Science, 3353, 222 - 234.
Goldengorin, B., Sierksma, G., & Turkensteen, M. (2004). Tolerance based algorithms for the ATSP. In J. Hromkovic, M. Nagl, & B. Westfechtel (Eds.), GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE (pp. 222-234). (Lecture Notes in Computer Science; Vol. 3353). BERLIN: Springer.

2003

Sierksma, G., & Tijssen, G. A. (2003). Degeneracy degrees of constraint collections. Mathematical Methods of Operations Research, 57(3), 437-448. https://doi.org/10.1007/s001860200259
Boon, BH., & Sierksma, G. (2003). Team formation: Matching quality supply and quality demand. European Journal of Operational Research, 148(2), 277-292. https://doi.org/10.1016/S0377-2217(02)00684-7
Goldengorin, B., Ghosh, D., & Sierksma, G. (2003). Branch and peg algorithms for the simple plant location problem. Computers & Operations Research, 30(7), 967 - 981. [PII S0305-0548(02)00049-7].
Goldengorin, B., Tijssen, G. A., Ghosh, D., & Sierksma, G. (2003). Solving the simple plant location problem using a data correcting approach. Journal of Global Optimization, 25(4), 377-406.
Goldengorin, B., & Sierksma, G. (2003). Combinatorial optimization tolerances calculated in linear time. (A30 ed.) Groningen: University of Groningen, SOM research school.
Sierksma, G. (2003). Computer support for team formation. International Journal of Computer Science in Sport, 2(1), 175 - 177.
Koning, R. H., Sierksma, G., & van der Velde, S. (2003). Introduction: Sport and computer. European Journal of Operational Research, 148(2), 231 - 232. https://doi.org/10.1016/s0377-2217(02)00679-3
Ghosh, D., & Sierksma, G. (2003). On the complexity of determining tolerances. Applicationes Mathematicae, 30(3), 305 - 313. https://doi.org/10.4064/am30-3-5

2002

Ghosh, D., & Sierksma, G. (2002). Complete local search with memory. Journal of Heuristics, 8(6), 571-584.
Broersma, A. L. A., Sierksma, G., & Wijngaard, J. (2002). Decomposed vs integrated control of a one-stage production system. European Journal of Operational Research, 138(3), 569-577. [PII S0377-2217(01)00146-1]. https://doi.org/10.1016/s0377-2217(01)00146-1
Boon, B. H., & Sierksma, G. (2002). Team formation as a logistical phenomenon. (A25 ed.) Groningen: University of Groningen, SOM research school.

2001

Goldengorin, B., Ghosh, D., & Sierksma, G. (2001). Branch and peg algorithms for the simple plant location problem. (A14 ed.) Groningen: University of Groningen, SOM research school.
Sierksma, G. (2001). Een kleine stap naar het oneindig grote. Nieuw Archief voor Wiskunde, 5(3), 210 - 216.
Sierksma, G. (2001). Het beste Nederlandse voetbalteam. In A. L. Bovenberg (Ed.), Jaarboek 2000/2001 (pp. 168 - 172). Rotterdam: Koninklijke Vereniging voor de Staathuishoudkunde.
Goldengorin, B., Ghosh, D., & Sierksma, G. (2001). Improving the efficiency of branch and bound algorithms for the simple plant location problem. Lecture Notes in Computer Science, 106 - 117.
Sierksma, G. (2001). Linear and integer programming; Theory and practice. New York: Marcel Dekker.
Goldengorin, B., Tijssen, G. A., Ghosh, D., & Sierksma, G. (2001). Solving the simple plant location problem using a data correcting approach. (A53 ed.) Groningen: University of Groningen, SOM research school.
Wanders, H. L. T., Gaalman, G. J. C., & Sierksma, G. (2001). The composition of semi finished inventories at a solid board plant. (A51 ed.) Groningen: University of Groningen, SOM research school.
Sierksma, G. (2001). Zeer moeilijk is makkelijk. Natuur & Techniek, 50 - 55.

2000

Sierksma, G., & Teunter, R. H. (2000). Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters. Discrete Applied Mathematics, 105(1-3), 173-182. https://doi.org/10.1016/S0166-218X(00)00203-1
Sierksma, G., & Wanders, HLT. (2000). The manufacturing of heavy weight cardboard. International Journal of Production Economics, 65(3), 295-303.
Ghosh, D., & Sierksma, G. (2000). Complete local search with memory. (A47 ed.) Groningen: University of Groningen, SOM research school.
Ghosh, D., & Sierksma, G. (2000). Complete local search with memory. s.n.
Changat, M., Mulder, H. M., & Sierksma, G. (2000). Convexities related to path properties on graphs. (E45 ed.) Groningen: University of Groningen, SOM research school.
Changat, M., Mulder, H. M., & Sierksma, G. (2000). Convexities related to path properties on graphs; a unified approach. s.n.
Goldengorin, B., Ghosh, D., & Sierksma, G. (2000). Equivalent instances of the simple plant location problem. (A54 ed.) Groningen: University of Groningen, SOM research school.
Ghosh, D., & Sierksma, G. (2000). On the complexity of determining tolerances for e-optimal solutions to min-max combinatorial optimization problems. (A35 ed.) Groningen: University of Groningen, SOM research school.
Ghosh, D., & Sierksma, G. (2000). On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems. s.n.
Ghosh, D., Chakravarti, N., & Sierksma, G. (2000). Sensitivity analysis of the greedy heuristic for binary knapsack problems. (A18 ed.) Groningen: University of Groningen, SOM research school.
Ghosh, D., Chakravarti, N., & Sierksma, G. (2000). Sensitivity analysis of the greedy heuristic for binary knapsack problems. s.n.

1999

Gaalman, GJC., & Sierksma, G. (1999). Production scheduling across multi-machine packaging lines for the prescheduling level. International Journal of Production Research, 37(16), 3619-3641.
Goldengorin, B., Sierksma, G., Tijssen, GA., & Tso, M. (1999). The data-correcting algorithm for the minimization of supermodular functions. Management Science, 45(11), 1539-1551.
Sierksma, G., & Sierksma, W. (1999). The great leap to the infinitely small. Johann Bernoulli: Mathematician and Philosopher: Mathematician and philosopher. Annals of Science, 56(4), 433-449. https://doi.org/10.1080/000337999296373
van der Poort, ES., Libura, M., Sierksma, G., & van der Veen, JAA. (1999). Solving the k-best traveling salesman problem. Computers & Operations Research, 26(4), 409-425.
Broersma, A. L. A., Sierksma, G., & Wijngaard, J. (1999). Decomposed versus integrated control of a one-stage production system. (A18 ed.) Groningen: University of Groningen, SOM research school.
Sierksma, G., & Wijngaard, J. (1999). Decomposed versus integrated control of a one-stage production system. s.n.
Gaalman, G. J. C., Jorna, R. J. J. M., & Sierksma, G. (1999). Integrating cognitive science and operations research techniques for building a better planning support system for a solid board factory. In P. Lenco, & et al. (Eds.), Human Centered Processes: HCP 1999 (pp. 2 - 5)
Sierksma, G. (1999). Limiting polytopes and periodic Markov chains. Linear and Multilinear Algebra, 281 - 298.
van Dam, P., Gaalman, G. J. C., & Sierksma, G. (1999). Production scheduling across multi-machine packaging lines for the pre-scheduling level. International Journal of Production Research, 16, 3619 - 3641.
Goldengorin, B., Sierksma, G., Tijssen, G. A., & Tso, M. (1999). The data-correcting algorithm for minimization of supermodular functions. Management Science, 11, 1539 - 1551. https://doi.org/10.1287/mnsc.45.11.1539
Goldengorin, B., Sierksma, G., & Tso, M. (1999). The maximization of submodular functions. (A17 ed.) Groningen: University of Groningen, SOM research school.

1998

van Dam, J. P., Gaalman, G. J. C., & Sierksma, G. (1998). Designing scheduling systems for packaging in process industries: A tobacco company case. International Journal of Production Economics, 56-7, 649-659. https://doi.org/10.1016/S0925-5273(98)00048-6
Tijssen, GA., & Sierksma, G. (1998). Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces. Mathematical Programming, 81(3), 349-372.
Sierksma, G., & Tijssen, G. A. (1998). Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research, 76, 261-286.
Sierksma, G. (1998). Interchange graphs and the Hamiltonian cycle polytope. Discrete Applied Mathematics, 81(1-3), 217-224.
Tijssen, G. A., & Sierksma, G. (1998). Balinski-Tucker simplex tableaux: dimensions, degeneracy degrees and interior points of optimal faces. Mathematical Programming, 349 - 372.
Sierksma, G. (1998). Interchange graphs and the Hamilton cycle polytope. Discrete Applied Mathematics, 217 - 224. https://doi.org/10.1016/s0166-218x(97)00086-3
Sierksma, G., & Sierksma, W. (1998). Johann Bernoulli (1667-1748). In H. A. Krop (Ed.), Zeer Kundige Professoren (pp. 119 - 133). Hilversum: Uitgeverij Verloren.
Libura, M., van der Poort, E. S., Sierksma, G., & van der Veen, J. A. A. (1998). Sensitivity analysis based on k-best solutions of the Traveling Salesman Problem. Discrete Applied Mathematics, 159 - 185.
Goldengorin, B., Sierksma, G., & Tso, M. (1998). The data-correcting algorithm for supermodular functions, with applications to quadratic cost partition and simple plant location problems. (A08 ed.) Groningen: University of Groningen, SOM research school.

1997

van der Poort, E. S., & Sierksma, G. (1997). Determining tolerances for the traveling salesman problem; a survey. (A27 ed.) Groningen: University of Groningen, SOM research school.
tenKate, H., vanderHoeven, T., & Sierksma, G. (1997). Transporting and mixing gasses with different qualities. Zeitschrift für Angewandte Mathematik und Mechanik, 77(2), 99-106.
van der Poort, E. S., Dimitrijevic, V., & Sierksma, G. (1997). Using stability information for solving the K-best traveling salesman problem. (A29 ed.) Groningen: University of Groningen, SOM research school.

1996

Sierksma, G., & Sierksma, W. (1996). Geometrical aspects of the limiting process of discrete-time periodic Markov chains. (A05 ed.) Groningen: University of Groningen, SOM research school.
Sierksma, G. (1996). Routing helicopters for crew exchanges on off-shore locations. (A07 ed.) Groningen: University of Groningen, SOM research school.
Gaalman, G. J. C., & Sierksma, G. (1996). Scheduling packaging lines in the process industry. (A21 ed.) Groningen: University of Groningen, SOM research school.
van Dam, J. P., Gaalman, G. J. C., & Sierksma, G. (1996). Scheduling packaging lines in the process industry: designing and applying a model for the pre-scheduling level. (A21 ed.) Groningen: University of Groningen, SOM research school.
Libura, M., & Sierksma, G. (1996). Sensitivity analysis based on k-best solutions of the travelling salesman problem. (A14 ed.) Groningen: University of Groningen, SOM research school.

1995

SIERKSMA, G., TEUNTER, RH., & TIJSSEN, GA. (1995). FACES OF DIAMETER-2 ON THE HAMILTONIAN CYCLE POLYTOPE. Operations Research Letters, 18(2), 59-64.

1993

VANDAL, R., VANDERVEEN, JAA., & SIERKSMA, G. (1993). SMALL AND LARGE TSP - 2 POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM. European Journal of Operational Research, 69(1), 107-120.
VANDAM, P., GAALMAN, G., & SIERKSMA, G. (1993). SCHEDULING OF PACKAGING LINES IN THE PROCESS INDUSTRY - AN EMPIRICAL-INVESTIGATION. International Journal of Production Economics, 30-1, 579-589.
SIERKSMA, G. (1993). THE SKELETON OF THE SYMMETRICAL TRAVELING SALESMAN POLYTOPE. Discrete Applied Mathematics, 43(1), 63-74.
Sterken, E., Sierksma, G., & Steenge, A. (1993). A generalisation of the Stolper-Samuelson and Kemp-Wegge theorems. Proceedings of the Georgian Academy of Sciences, 1, 50-53.

1992

SIERKSMA, G., & TIJSSEN, GA. (1992). FACES WITH LARGE DIAMETER ON THE SYMMETRICAL TRAVELING SALESMAN POLYTOPE. Operations Research Letters, 12(2), 73-77.
SIERKSMA, G. (1992). BERNOULLI,JOHANN (1667-1748) - HIS 10 TURBULENT YEARS IN GRONINGEN. Mathematical intelligencer, 14(4), 22-31.

1991

SIERKSMA, G. (1991). 7 CRITERIA FOR INTEGER SEQUENCES BEING GRAPHIC. Journal of graph theory, 15(2), 223-231.
VANDERVEEN, JAA., SIERKSMA, G., & VANDAL, R. (1991). PYRAMIDAL TOURS AND THE TRAVELING SALESMAN PROBLEM. European Journal of Operational Research, 52(1), 90-102.

1989

SIERKSMA, G., & VINK, J. (1989). COUNTING HAMILTONIAN CYCLES WITH TSP HEURISTICS IN RANDOM GRAPHS. Ekonomicko-Matematicky obzor, 25(3), 312-319.
JANSSEN, M., & SIERKSMA, G. (1989). PRICE CHANGES RESULTING FROM TAXES AND SUBSIDIES IN LEONTIEF MODELS. Ekonomicko-Matematicky obzor, 25(4), 390-395.

1988

SIERKSMA, G. (1988). HOW TO SCHEDULE MEETINGS WITH A TRAVELING SALESMAN Q-AND-D, AND WHY WE DIDNT. Interfaces, 18(2), 105-107.

1987

SIERKSMA, G., & STEENGE, AE. (1987). 2-MINOR STABLE MATRICES AND THE OPEN LEONTIEF-MODEL. Linear Algebra and Its Applications, 95, 1-10.

1986

SIERKSMA, G. (1986). THE STRUCTURE MATRIX OF (0,1)-MATRICES - ITS RANK, TRACE, AND EIGENVALUES - AN APPLICATION TO ECONOMETRIC-MODELS. Linear Algebra and Its Applications, 83, 151-166.
SIERKSMA, G., & BAKKER, EJ. (1986). NEARLY PRINCIPAL MINORS OF M-MATRICES. Compositio mathematica, 59(1), 73-79.
Sterken, E., & Sierksma, G. (1986). The structure matrix of (0,1)-matrices; Its rank, trace and eigenvalues. An application to econometric models. Linear Algebra & Applications, 83, 151-166.

1984

SIERKSMA, G., & DEVOS, K. (1984). CONVEX POLYTOPES AS MATRIX INVARIANTS. Compositio mathematica, 52(2), 203-210.
SIERKSMA, G. (1984). EXTENDING A CONVEXITY SPACE TO AN ALIGNED SPACE. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen. Series A:Mathematical Sciences, 87(4), 429-435.

1982

SIERKSMA, G. (1982). GENERALIZED RADON PARTITIONS IN CONVEXITY SPACES. Archiv der mathematik, 39(6), 568-576.

1981

SIERKSMA, G. (1981). CONVEXITY ON UNIONS OF SETS. Compositio mathematica, 42(3), 391-400.
LINDQUIST, N., & SIERKSMA, G. (1981). EXTENSIONS OF SET PARTITIONS. Journal of Combinatorial Theory. Series A, 31(2), 190-198.

1979

SIERKSMA, G. (1979). NONNEGATIVE MATRICES - OPEN LEONTIEF-MODEL. Linear Algebra and Its Applications, 26(AUG), 175-201.

1975

Sierksma, G. (1975). Carathéodory and Helly-numbers of convex-product-structures. Pacific Journal of Mathematics, 61(1), 275-282. https://doi.org/10.2140/pjm.1975.61.275
Last modified:13 March 2020 4.14 p.m.
printView this page in: Nederlands