default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerard Sierksma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j30]Marcel Turkensteen, Gerard Sierksma, Jaap E. Wieringa:
Balancing the fit and logistics costs of market segmentations. Eur. J. Oper. Res. 213(1): 340-348 (2011)
2000 – 2009
- 2009
- [j29]Bader F. AlBdaiwi, Boris Goldengorin
, Gerard Sierksma:
Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57(5): 812-820 (2009) - [j28]Yori Zwols, Gerard Sierksma:
OR Practice - Training Optimization for the Decathlon. Oper. Res. 57(4): 812-822 (2009) - 2008
- [j27]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189(3): 775-788 (2008) - 2007
- [j26]David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma:
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. Eur. J. Oper. Res. 177(1): 147-162 (2007) - 2006
- [j25]Gerard Sierksma, Gert A. Tijssen:
Simplex Adjacency Graphs in Linear Optimization. Algorithmic Oper. Res. 1(1) (2006) - [j24]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3(1): 63-77 (2006) - [j23]Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma:
Sensitivity analysis of a greedy heuristic for knapsack problems. Eur. J. Oper. Res. 169(1): 340-350 (2006) - 2005
- [j22]Manoj Changat, Henry Martyn Mulder, Gerard Sierksma:
Convexities related to path properties on graphs. Discret. Math. 290(2/3): 117-131 (2005) - 2004
- [j21]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31(2): 241-255 (2004) - [j20]Henrico L. T. Wanders, Gerard J. C. Gaalman, Gerard Sierksma:
The composition of semi-finished inventories at a solid board plant. Eur. J. Oper. Res. 155(1): 96-111 (2004) - [c2]Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen:
Tolerance Based Algorithms for the ATSP. WG 2004: 222-234 - 2003
- [j19]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30(7): 967-981 (2003) - [j18]Ruud H. Koning, Gerard Sierksma, Steef L. van de Velde:
Introduction: Sport and Computers. Eur. J. Oper. Res. 148(2): 231-232 (2003) - [j17]Bart H. Boon, Gerard Sierksma:
Team formation: Matching quality supply and quality demand. Eur. J. Oper. Res. 148(2): 277-292 (2003) - [j16]Gerard Sierksma:
Computer Support for Team Formation. Int. J. Comput. Sci. Sport 2(1) (2003) - [j15]Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma:
Solving the Simple Plant Location Problem using a Data Correcting Approach. J. Glob. Optim. 25(4): 377-406 (2003) - [j14]Gerard Sierksma, Gert A. Tijssen:
Degeneracy degrees of constraint collections. Math. Methods Oper. Res. 57(3): 437-448 (2003) - 2002
- [j13]Andreas L. A. Broersma, Gerard Sierksma, Jacob Wijngaard:
Decomposed vs integrated control of a one-stage production system. Eur. J. Oper. Res. 138(3): 569-577 (2002) - [j12]Diptesh Ghosh, Gerard Sierksma:
Complete Local Search with Memory. J. Heuristics 8(6): 571-584 (2002) - 2001
- [c1]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE 2001: 106-117 - 2000
- [j11]Gerard Sierksma, Ruud H. Teunter:
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters. Discret. Appl. Math. 105(1-3): 173-182 (2000)
1990 – 1999
- 1999
- [j10]Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen:
Solving the k-best traveling salesman problem. Comput. Oper. Res. 26(4): 409-425 (1999) - 1998
- [j9]Gerard Sierksma, Gert A. Tijssen:
Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76: 261-286 (1998) - [j8]Gerard Sierksma:
Interchange Graphs and the Hamiltonian Cycle Polytope. Discret. Appl. Math. 81(1-3): 217-224 (1998) - [j7]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. Discret. Appl. Math. 87(1-3): 159-185 (1998) - [j6]Gert A. Tijssen, Gerard Sierksma:
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces. Math. Program. 81: 349-372 (1998) - 1996
- [b1]Gerard Sierksma:
Linear and integer programming - theory and practice. Pure and applied mathematics 198, Dekker 1996, ISBN 978-0-8247-9695-2, pp. I-XIV, 1-673 - 1995
- [j5]Gerard Sierksma, Ruud H. Teunter, Gert A. Tijssen:
Faces of diameter two on the Hamiltonian cycle polytype. Oper. Res. Lett. 18(2): 59-64 (1995) - 1993
- [j4]Gerard Sierksma:
The Skeleton of the Symmetric Traveling Salesman Polytope. Discret. Appl. Math. 43(1): 63-74 (1993) - 1992
- [j3]Gerard Sierksma, Gert A. Tijssen:
Faces with large diameter on the symmetric traveling salesman polytope. Oper. Res. Lett. 12(2): 73-77 (1992) - 1991
- [j2]Gerard Sierksma, Han Hoogeveen:
Seven criteria for integer sequences being graphic. J. Graph Theory 15(2): 223-231 (1991)
1980 – 1989
- 1981
- [j1]Norman Lindquist, Gerard Sierksma:
Extensions of Set Partitions. J. Comb. Theory A 31(2): 190-198 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
