Gerard Sierksma

According to our database, Gerard Sierksma authored at least 32 papers between 1981 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2011

Balancing the fit and logistics costs of market segmentations.

Marcel Turkensteen, Gerard Sierksma, Jaap E. Wieringa

Eur. J. Oper. Res., 2011

2009

OR Practice - Training Optimization for the Decathlon.

Yori Zwols, Gerard Sierksma

Oper. Res., 2009

Equivalent instances of the simple plant location problem.

Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma

Comput. Math. Appl., 2009

2008

Tolerance-based Branch and Bound algorithms for the ATSP.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Eur. J. Oper. Res., 2008

2007

Cyclic multiple-robot scheduling with time-window constraints using a critical path approach.

David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma

Eur. J. Oper. Res., 2007

2006

Sensitivity analysis of a greedy heuristic for knapsack problems.

Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma

Eur. J. Oper. Res., 2006

Iterative patching and the asymmetric traveling salesman problem.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Discret. Optim., 2006

Simplex Adjacency Graphs in Linear Optimization.

Gerard Sierksma, Gert A. Tijssen

Algorithmic Oper. Res., 2006

2005

Convexities related to path properties on graphs.

Manoj Changat, Henry Martyn Mulder, Gerard Sierksma

Discret. Math., 2005

2004

The composition of semi-finished inventories at a solid board plant.

Henrico L. T. Wanders, Gerard J. C. Gaalman, Gerard Sierksma

Eur. J. Oper. Res., 2004

Branch and peg algorithms for the simple plant location problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Comput. Oper. Res., 2004

Tolerance Based Algorithms for the ATSP.

Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Degeneracy degrees of constraint collections.

Gerard Sierksma, Gert A. Tijssen

Math. Methods Oper. Res., 2003

Solving the Simple Plant Location Problem using a Data Correcting Approach.

Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma

J. Glob. Optim., 2003

Computer Support for Team Formation.

Gerard Sierksma

Int. J. Comput. Sci. Sport, 2003

Introduction: Sport and Computers.

Ruud H. Koning, Gerard Sierksma, Steef L. van de Velde

Eur. J. Oper. Res., 2003

Team formation: Matching quality supply and quality demand.

Bart H. Boon, Gerard Sierksma

Eur. J. Oper. Res., 2003

2002

Complete Local Search with Memory.

Diptesh Ghosh, Gerard Sierksma

J. Heuristics, 2002

Decomposed vs integrated control of a one-stage production system.

Andreas L. A. Broersma, Gerard Sierksma, Jacob Wijngaard

Eur. J. Oper. Res., 2002

2001

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Proceedings of the Algorithm Engineering, 2001

2000

Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters.

Gerard Sierksma, Ruud H. Teunter

Discret. Appl. Math., 2000

1999

Solving the <i>k</i>-best traveling salesman problem.

Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen

Comput. Oper. Res., 1999

1998

Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces.

Gert A. Tijssen, Gerard Sierksma

Math. Program., 1998

Interchange Graphs and the Hamiltonian Cycle Polytope.

Gerard Sierksma

Discret. Appl. Math., 1998

Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions.

Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen

Discret. Appl. Math., 1998

Routing helicopters for crew exchanges on off-shore locations.

Gerard Sierksma, Gert A. Tijssen

Ann. Oper. Res., 1998

1996

Linear and integer programming - theory and practice.

Gerard Sierksma

Pure and applied mathematics 198, Dekker, ISBN: 978-0-8247-9695-2, 1996

1995

Faces of diameter two on the Hamiltonian cycle polytype.

Gerard Sierksma, Ruud H. Teunter, Gert A. Tijssen

Oper. Res. Lett., 1995

1993

The Skeleton of the Symmetric Traveling Salesman Polytope.

Gerard Sierksma

Discret. Appl. Math., 1993

1992

Faces with large diameter on the symmetric traveling salesman polytope.

Gerard Sierksma, Gert A. Tijssen

Oper. Res. Lett., 1992

1991

Seven criteria for integer sequences being graphic.

Gerard Sierksma, Han Hoogeveen

J. Graph Theory, 1991

1981

Extensions of Set Partitions.

Norman Lindquist, Gerard Sierksma

J. Comb. Theory, Ser. A, 1981