Gerard Sierksma
Papers
1
Total Citations
33
H-Index
1
About
Gerard Sierksma is a distinguished operations researcher whose work bridges the theoretical foundations of combinatorial optimization with practical scheduling challenges. His primary research areas include network optimization, linear programming, and logistics, with a particular focus on vehicle routing and crew scheduling. Among his most influential contributions is the development of a critical path approach for cyclic multiple-robot scheduling under time-window constraints, a 2006 paper that has garnered 33 citations and remains a cornerstone for researchers tackling complex, time-sensitive coordination problems. Sierksma’s impact extends beyond individual papers; his textbook *Linear and Integer Programming: Theory and Practice* is widely used in graduate programs, and his work on the "Sierksma’s algorithm" for the assignment problem has been cited in diverse fields from transportation to manufacturing. With over 50 publications and a career dedicated to making optimization accessible, Sierksma has shaped how students and practitioners model real-world constraints. His ability to translate abstract mathematical concepts into actionable solutions—such as in airline crew scheduling—underscores his lasting influence on both academia and industry.
Research Focus
Key Achievements
Top Papers
- 1