Frits Spieksma

Papers

Total Citations

H-Index

About

Frits Spieksma is a distinguished operations researcher whose work bridges combinatorial optimization and real-world decision-making. His primary research areas include discrete optimization, scheduling theory, and data association problems, with a particular focus on developing efficient algorithms for complex logistical and tracking systems. His most cited work, "An LP-based algorithm for the data association problem in multitarget tracking" (2003, 70 citations), introduced a novel linear programming approach to resolve the challenge of associating sensor data with multiple moving targets—a critical problem in defense, surveillance, and autonomous systems. This contribution exemplifies his talent for translating theoretical optimization techniques into practical solutions, earning him recognition as a leading figure in the field. Beyond this landmark paper, Spieksma has made significant strides in railway scheduling, sports timetabling, and supply chain management, often collaborating with industry partners to implement his algorithms. His research has garnered over 2,000 citations, reflecting its lasting impact on both academia and applied domains. A professor at KU Leuven, he is also known for his mentorship and for advancing the use of integer programming in dynamic environments, making him a pivotal voice in modern operations research.