The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gerard Sierksma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.418secs, Finished in 0.419secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002