Gerard Sierksma

Publication Activity (10 Years)

Years Active: 1981-2011
Publications (10 Years): 0

Publications

Marcel Turkensteen, Gerard Sierksma, Jaap E. Wieringa
Balancing the fit and logistics costs of market segmentations. Eur. J. Oper. Res. 213 (1) (2011)
Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma
Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57 (5) (2009)
Yori Zwols, Gerard Sierksma
OR Practice - Training Optimization for the Decathlon. Oper. Res. 57 (4) (2009)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189 (3) (2008)
David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. Eur. J. Oper. Res. 177 (1) (2007)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3 (1) (2006)
Gerard Sierksma, Gert A. Tijssen
Simplex Adjacency Graphs in Linear Optimization. Algorithmic Oper. Res. 1 (1) (2006)
Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma
Sensitivity analysis of a greedy heuristic for knapsack problems. Eur. J. Oper. Res. 169 (1) (2006)
Manoj Changat, Henry Martyn Mulder, Gerard Sierksma
Convexities related to path properties on graphs. Discret. Math. 290 (2/3) (2005)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31 (2) (2004)
Henrico L. T. Wanders, Gerard J. C. Gaalman, Gerard Sierksma
The composition of semi-finished inventories at a solid board plant. Eur. J. Oper. Res. 155 (1) (2004)
Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
Tolerance Based Algorithms for the ATSP. WG (2004)
Gerard Sierksma, Gert A. Tijssen
Degeneracy degrees of constraint collections. Math. Methods Oper. Res. 57 (3) (2003)
Gerard Sierksma
Computer Support for Team Formation. Int. J. Comput. Sci. Sport 2 (1) (2003)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30 (7) (2003)
Ruud H. Koning, Gerard Sierksma, Steef L. van de Velde
Introduction: Sport and Computers. Eur. J. Oper. Res. 148 (2) (2003)
Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma
Solving the Simple Plant Location Problem using a Data Correcting Approach. J. Glob. Optim. 25 (4) (2003)
Bart H. Boon, Gerard Sierksma
Team formation: Matching quality supply and quality demand. Eur. J. Oper. Res. 148 (2) (2003)
Diptesh Ghosh, Gerard Sierksma
Complete Local Search with Memory. J. Heuristics 8 (6) (2002)
Andreas L. A. Broersma, Gerard Sierksma, Jacob Wijngaard
Decomposed vs integrated control of a one-stage production system. Eur. J. Oper. Res. 138 (3) (2002)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE (2001)
Gerard Sierksma, Ruud H. Teunter
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters. Discret. Appl. Math. 105 (1-3) (2000)
Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen
-best traveling salesman problem. Comput. Oper. Res. 26 (4) (1999)
Gerard Sierksma, Gert A. Tijssen
Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76 (1998)
Gert A. Tijssen, Gerard Sierksma
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces. Math. Program. 81 (1998)
Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen
Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions. Discret. Appl. Math. 87 (1-3) (1998)
Gerard Sierksma
Interchange Graphs and the Hamiltonian Cycle Polytope. Discret. Appl. Math. 81 (1-3) (1998)
Gerard Sierksma, Ruud H. Teunter, Gert A. Tijssen
Faces of diameter two on the Hamiltonian cycle polytype. Oper. Res. Lett. 18 (2) (1995)
Gerard Sierksma
The Skeleton of the Symmetric Traveling Salesman Polytope. Discret. Appl. Math. 43 (1) (1993)
Gerard Sierksma, Gert A. Tijssen
Faces with large diameter on the symmetric traveling salesman polytope. Oper. Res. Lett. 12 (2) (1992)
Gerard Sierksma, Han Hoogeveen
Seven criteria for integer sequences being graphic. J. Graph Theory 15 (2) (1991)
Norman Lindquist, Gerard Sierksma
Extensions of Set Partitions. J. Comb. Theory, Ser. A 31 (2) (1981)