Gerard Sierksma

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