Gerard Sierksma - Concepedia

Author

Gerard Sierksma

University of Groningen

Also Known As

11th World Congress of Performance Analysis of Sport, G. Sierksma, Gerard Sierksma, Gerardus Sierksma

111

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

University of Groningen Indian Institute of Management Ahmedabad Systems Research Institute Wageningen University & Research Nyenrode Business University

About

Gerard Sierksma is an author at University of Groningen specializing in engineering, discrete mathematics, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	14	17	442
2	Business	4	4	111
3	Education	2	2	99
4	Natural Sciences	2	2	32
5	Health Sciences	1	1	12

Gerard Sierksma

Publications

932

Citations

H-Index

Page 1

	Year	Citations
Seven criteria for integer sequences being graphic Gerard Sierksma, Han Hoogeveen Journal of Graph Theory Integer SequencesCombinatorics On WordGraph TheorySeven CriteriaAbstract Seven Criteria	1991	112
Convexities related to path properties on graphs Manoj Changat, Henry Martyn Mulder, Gerard Sierksma Discrete Mathematics Geometric Graph TheoryGraph TheoryExtremal Graph TheoryEducationNetwork Analysis	2005	84
Routing helicopters for crew exchanges on off-shore locations Gerard Sierksma, Gert A. Tijssen Annals of Operations Research	1998	75
Carathéodory and Helly-numbers of convex-product-structures Gerard Sierksma Pacific Journal of Mathematics	1975	72
The Data-Correcting Algorithm for the Minimization of Supermodular Functions Boris Goldengorin, Gerard Sierksma, Gert A. Tijssen, Management Science Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringComputational ComplexityDiscrete Optimization	1999	58
Branch and peg algorithms for the simple plant location problem Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma Computers & Operations Research Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringPeg AlgorithmsCombinatorial Problem	2003	54
Stability aspects of the traveling salesman problem based on k-best solutions Marek Libura, E.S. van der Poort, Gerard Sierksma, Discrete Applied Mathematics Mathematical ProgrammingEngineeringStabilityTraveling Salesman ProblemCombinatorial Problem	1998	44
Solving the k-best traveling salesman problem E.S. van der Poort, Marek Libura, Gerard Sierksma, Computers & Operations Research Mathematical ProgrammingEngineeringTraveling Salesman ProblemCombinatorial ProblemLogistics	1999	38
Tolerance-based Branch and Bound algorithms for the ATSP Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, European Journal of Operational Research Mathematical ProgrammingReachability AnalysisBranch-and-bound AlgorithmTolerance-based BranchEngineering	2007	37
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach David Alcaide López de Pablo, Chengbin Chu, Vladimir Kats, European Journal of Operational Research EngineeringScheduling AnalysisCritical Path ApproachCyclic Multiple-robot SchedulingScheduling Problem	2006	33

Page 1