Gerard Sierksma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2011

Balancing the fit and logistics costs of market segmentationsMarcel Turkensteen, Gerard Sierksma, Jaap E. Wieringa. eor, 213(1):340-348, 2011. [doi]

2009

Equivalent instances of the simple plant location problemBader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma. cma, 57(5):812-820, 2009. [doi]

OR Practice - Training Optimization for the DecathlonYori Zwols, Gerard Sierksma. ior, 57(4):812-822, 2009. [doi]

2008

Tolerance-based Branch and Bound algorithms for the ATSPMarcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma. eor, 189(3):775-788, 2008. [doi]

2007

Cyclic multiple-robot scheduling with time-window constraints using a critical path approachDavid Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma. eor, 177(1):147-162, 2007. [doi]

2006

Sensitivity analysis of a greedy heuristic for knapsack problemsDiptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma. eor, 169(1):340-350, 2006. [doi]

Simplex Adjacency Graphs in Linear OptimizationGerard Sierksma, Gert A. Tijssen. aor, 1(1), 2006. [doi]

Iterative patching and the asymmetric traveling salesman problemMarcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma. disopt, 3(1):63-77, 2006. [doi]

2005

Convexities related to path properties on graphsManoj Changat, Henry Martyn Mulder, Gerard Sierksma. DM, 290(2/3):117-131, 2005. [doi]

2004

Tolerance Based Algorithms for the ATSPBoris Goldengorin, Gerard Sierksma, Marcel Turkensteen. criwg 2004: 222-234 [doi]

Branch and peg algorithms for the simple plant location problemBoris Goldengorin, Diptesh Ghosh, Gerard Sierksma. cor, 31(2):241-255, 2004. [doi]

The composition of semi-finished inventories at a solid board plantHenrico L. T. Wanders, Gerard J. C. Gaalman, Gerard Sierksma. eor, 155(1):96-111, 2004. [doi]

2003

Team formation: Matching quality supply and quality demandBart H. Boon, Gerard Sierksma. eor, 148(2):277-292, 2003. [doi]

Branch and peg algorithms for the simple plant location problemBoris Goldengorin, Diptesh Ghosh, Gerard Sierksma. cor, 30(7):967-981, 2003. [doi]

Solving the Simple Plant Location Problem using a Data Correcting ApproachBoris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma. jgo, 25(4):377-406, 2003. [doi]

Introduction: Sport and ComputersRuud H. Koning, Gerard Sierksma, Steef L. van de Velde. eor, 148(2):231-232, 2003. [doi]

Degeneracy degrees of constraint collectionsGerard Sierksma, Gert A. Tijssen. mmor, 57(3):437-448, 2003. [doi]

Computer Support for Team FormationGerard Sierksma. ijcssport, 2(1), 2003.

2002

Decomposed vs integrated control of a one-stage production systemAndreas L. A. Broersma, Gerard Sierksma, Jacob Wijngaard. eor, 138(3):569-577, 2002. [doi]

Complete Local Search with MemoryDiptesh Ghosh, Gerard Sierksma. heuristics, 8(6):571-584, 2002.

2001

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location ProblemBoris Goldengorin, Diptesh Ghosh, Gerard Sierksma. wae 2001: 106-117 [doi]

2000

Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diametersGerard Sierksma, Ruud H. Teunter. DAM, 105(1-3):173-182, 2000.

1999

Solving the ::::k::::-best traveling salesman problemEdo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen. cor, 26(4):409-425, 1999. [doi]

1998

1996

Linear and integer programming - theory and practiceGerard Sierksma. Volume 198 of Pure and applied mathematics, Dekker, 1996.

1995

Faces of diameter two on the Hamiltonian cycle polytypeGerard Sierksma, Ruud H. Teunter, Gert A. Tijssen. orl, 18(2):59-64, 1995. [doi]

1993

The Skeleton of the Symmetric Traveling Salesman PolytopeGerard Sierksma. DAM, 43(1):63-74, 1993. [doi]

1992

Faces with large diameter on the symmetric traveling salesman polytopeGerard Sierksma, Gert A. Tijssen. orl, 12(2):73-77, 1992. [doi]

1991

Seven criteria for integer sequences being graphicGerard Sierksma, Han Hoogeveen. jgt, 15(2):223-231, 1991. [doi]

1981

Extensions of Set PartitionsNorman Lindquist, Gerard Sierksma. JCT, 31(2):190-198, 1981.

Sign in or sign up to see more results.

runs on WebDSL