| 2008 |
|---|
| 21 | EE | Marcel Turkensteen,
Diptesh Ghosh,
Boris Goldengorin,
Gerard Sierksma:
Tolerance-based Branch and Bound algorithms for the ATSP.
European Journal of Operational Research 189(3): 775-788 (2008) |
| 2007 |
|---|
| 20 | EE | David Alcaide,
Chengbin Chu,
Vladimir Kats,
Eugene Levner,
Gerard Sierksma:
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach.
European Journal of Operational Research 177(1): 147-162 (2007) |
| 2006 |
|---|
| 19 | EE | Gerard Sierksma,
Gert A. Tijssen:
Simplex Adjacency Graphs in Linear Optimization.
Algorithmic Operations Research 1(1): (2006) |
| 18 | EE | Marcel Turkensteen,
Diptesh Ghosh,
Boris Goldengorin,
Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem.
Discrete Optimization 3(1): 63-77 (2006) |
| 17 | EE | Diptesh Ghosh,
Nilotpal Chakravarti,
Gerard Sierksma:
Sensitivity analysis of a greedy heuristic for knapsack problems.
European Journal of Operational Research 169(1): 340-350 (2006) |
| 2005 |
|---|
| 16 | EE | Manoj Changat,
Henry Martyn Mulder,
Gerard Sierksma:
Convexities related to path properties on graphs.
Discrete Mathematics 290(2/3): 117-131 (2005) |
| 2004 |
|---|
| 15 | EE | Boris Goldengorin,
Gerard Sierksma,
Marcel Turkensteen:
Tolerance Based Algorithms for the ATSP.
WG 2004: 222-234 |
| 14 | EE | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 31(2): 241-255 (2004) |
| 13 | EE | Henrico L. T. Wanders,
Gerard J. C. Gaalman,
Gerard Sierksma:
The composition of semi-finished inventories at a solid board plant.
European Journal of Operational Research 155(1): 96-111 (2004) |
| 2003 |
|---|
| 12 | EE | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 30(7): 967-981 (2003) |
| 11 | EE | Ruud H. Koning,
Gerard Sierksma,
Steef L. van de Velde:
Introduction: Sport and Computers.
European Journal of Operational Research 148(2): 231-232 (2003) |
| 10 | EE | Bart H. Boon,
Gerard Sierksma:
Team formation: Matching quality supply and quality demand.
European Journal of Operational Research 148(2): 277-292 (2003) |
| 2002 |
|---|
| 9 | | Diptesh Ghosh,
Gerard Sierksma:
Complete Local Search with Memory.
J. Heuristics 8(6): 571-584 (2002) |
| 2001 |
|---|
| 8 | EE | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
Algorithm Engineering 2001: 106-117 |
| 2000 |
|---|
| 7 | | Gerard Sierksma,
Ruud H. Teunter:
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters.
Discrete Applied Mathematics 105(1-3): 173-182 (2000) |
| 1999 |
|---|
| 6 | EE | Edo S. Van der Poort,
Marek Libura,
Gerard Sierksma,
Jack A. A. van der Veen:
Solving the k-best traveling salesman problem.
Computers & OR 26(4): 409-425 (1999) |
| 1998 |
|---|
| 5 | EE | Gerard Sierksma:
Interchange Graphs and the Hamiltonian Cycle Polytope.
Discrete Applied Mathematics 81(1-3): 217-224 (1998) |
| 4 | EE | 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.
Discrete Applied Mathematics 87(1-3): 159-185 (1998) |
| 3 | | Gert A. Tijssen,
Gerard Sierksma:
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces.
Math. Program. 81: 349-372 (1998) |
| 1993 |
|---|
| 2 | EE | Gerard Sierksma:
The Skeleton of the Symmetric Traveling Salesman Polytope.
Discrete Applied Mathematics 43(1): 63-74 (1993) |
| 1981 |
|---|
| 1 | | Norman Lindquist,
Gerard Sierksma:
Extensions of Set Partitions.
J. Comb. Theory, Ser. A 31(2): 190-198 (1981) |
