Frits C. R. Spieksma

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 57

Top Venues

Publications

Bart Smeulders, Danny Blom, Frits C. R. Spieksma
Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete. Math. Program. 203 (1) (2024)
Danny Blom, Bart Smeulders, Frits C. R. Spieksma
Rejection-proof mechanisms for multi-agent kidney exchange. Games Econ. Behav. 143 (2024)
Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. 38 (1) (2024)
Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
Stable and Dynamic Minimum Cuts. WALCOM (2024)
Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM (2023)
Jasper van Doornmalen, Christopher Hojny, Roel Lambers, Frits C. R. Spieksma
Integer programming models for round robin tournaments. Eur. J. Oper. Res. 310 (1) (2023)
Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
Finding Diverse Minimum s-t Cuts. CoRR (2023)
Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
Finding Diverse Minimum s-t Cuts. ISAAC (2023)
Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma
The flexibility of home away pattern sets. J. Sched. 26 (5) (2023)
Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51 (5) (2023)
Kelin Luo, Frits C. R. Spieksma
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. Algorithms 15 (2) (2022)
Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. J. Sched. 25 (5) (2022)
Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma
A project scheduling problem with periodically aggregated resource-constraints. Comput. Oper. Res. 141 (2022)
Frits C. R. Spieksma
Obituary for Gerhard Woeginger. Bull. EATCS 137 (2022)
Bart Vangerven, Dirk Briskorn, Dries R. Goossens, Frits C. R. Spieksma
Parliament seating assignment problems. Eur. J. Oper. Res. 296 (3) (2022)
Danny Blom, Bart Smeulders, Frits C. R. Spieksma
Rejection-proof Kidney Exchange Mechanisms. CoRR (2022)
Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50 (3) (2022)
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
Package Delivery Using Drones with Restricted Movement Areas. ISAAC (2022)
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
Package Delivery Using Drones with Restricted Movement Areas. CoRR (2022)
Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT (2022)
Bart Smeulders, Valentin Bartier, Yves Crama, Frits C. R. Spieksma
Recourse in Kidney Exchange Programs. INFORMS J. Comput. 34 (2) (2022)
Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma
Filling a Theater During the COVID-19 Pandemic. INFORMS J. Appl. Anal. 52 (6) (2022)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
The transportation problem with conflicts. Ann. Oper. Res. 298 (1) (2021)
Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma
The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. CPAIOR (2021)
Kelin Luo, Frits C. R. Spieksma
Online Bin Packing with Overload Cost. CALDAM (2021)
Péter Biró, Joris van de Klundert, David F. Manlove, William Pettersson, Tommy Andersson, Lisa Burnapp, Pavel Chromy, Pablo Delgado, Piotr Dworczak, Bernadette Haase, Aline Hemke, Rachel Johnson, Xenia Klimentova, Dirk Kuypers, Alessandro Nanni Costa, Bart Smeulders, Frits C. R. Spieksma, María O. Valentín, Ana Viana
Modelling and optimisation in European Kidney Exchange Programmes. Eur. J. Oper. Res. 291 (2) (2021)
Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma
Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions. Bus. Inf. Syst. Eng. 63 (2) (2021)
Tim Ophelders, Roel Lambers, Frits C. R. Spieksma, Tjark Vredeveld
A note on equitable Hamiltonian cycles. Discret. Appl. Math. 303 (2021)
Lotte Berghman, Frits C. R. Spieksma, Vincent T'kindt
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. RAIRO Oper. Res. 55 (Supplement) (2021)
Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR (2021)
Morteza Davari, Dries R. Goossens, Jeroen Beliën, Roel Lambers, Frits C. R. Spieksma
The multi-league sports scheduling problem, or how to schedule thousands of matches. Oper. Res. Lett. 48 (2) (2020)
Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma
Filling a theatre in times of corona. CoRR (2020)
Kelin Luo, Frits C. R. Spieksma
Approximation Algorithms for Car-Sharing Problems. COCOON (2020)
Bart Smeulders, Danny Blom, Frits C. R. Spieksma
-complete. CoRR (2020)
Kelin Luo, Frits C. R. Spieksma
Approximation algorithms for car-sharing problems. CoRR (2020)
Ward Passchyn, Frits C. R. Spieksma
Scheduling parallel batching machines in a sequence. J. Sched. 22 (3) (2019)
Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
No-Wait Scheduling for Locks. INFORMS J. Comput. 31 (3) (2019)
David Van Bulck, Dries R. Goossens, Frits C. R. Spieksma
Scheduling a non-professional indoor football league: a tabu search based approach. Ann. Oper. Res. 275 (2) (2019)
Bart Smeulders, Yves Crama, Frits C. R. Spieksma
Revealed preference theory: An algorithmic outlook. Eur. J. Oper. Res. 272 (3) (2019)
Nicolas Pinson, Frits C. R. Spieksma
Online interval scheduling on two related machines: the power of lookahead. J. Comb. Optim. 38 (1) (2019)
Túlio A. M. Toffolo, Jan Christiaens, Frits C. R. Spieksma, Greet Vanden Berghe
The sport teams grouping problem. Ann. Oper. Res. 275 (1) (2019)
Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
Round-robin tournaments generated by the Circle Method have maximum carry-over. Math. Program. 172 (1-2) (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC (2018)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
Robust balanced optimization. EURO J. Comput. Optim. 6 (3) (2018)
Bart Smeulders, Clintin P. Davis-Stober, Michel Regenwetter, Frits C. R. Spieksma
Testing probabilistic models of choice using column generation. Comput. Oper. Res. 95 (2018)
Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma
Winner determination in geometrical combinatorial auctions. Eur. J. Oper. Res. 258 (1) (2017)
Joris Kinable, Bart Smeulders, Eline Delcour, Frits C. R. Spieksma
Exact algorithms for the Equitable Traveling Salesman Problem. Eur. J. Oper. Res. 261 (2) (2017)
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
Fast separation for the three-index assignment problem. Math. Program. Comput. 9 (1) (2017)
Yves Crama, Dries R. Goossens, Roel Leus, Michaël Schyns, Frits C. R. Spieksma
Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015). J. Sched. 20 (6) (2017)
Ward Passchyn, Sofie Coene, Dirk Briskorn, Johann L. Hurink, Frits C. R. Spieksma, Greet Vanden Berghe
The lockmaster's problem. Eur. J. Oper. Res. 251 (2) (2016)
Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
Mathematical programming models for lock scheduling with an emission objective. Eur. J. Oper. Res. 248 (3) (2016)
Fabrice Talla Nobibon, Laurens Cherchye, Yves Crama, Thomas Demuynck, Bram De Rock, Frits C. R. Spieksma
Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms. Oper. Res. 64 (6) (2016)
Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. IPCO (2016)
Trivikram Dokka, Frits C. R. Spieksma
Facets of the axial three-index assignment polytope. Discret. Appl. Math. 201 (2016)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
Balanced Optimization with Vector Costs. WAOA (2016)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The Focus of Attention Problem. Algorithmica 74 (2) (2016)
Fabrice Talla Nobibon, Bart Smeulders, Frits C. R. Spieksma
A Note on Testing Axioms of Revealed Preference. J. Optim. Theory Appl. 166 (3) (2015)
Lotte Berghman, Frits C. R. Spieksma
Valid inequalities for a time-indexed formulation. Oper. Res. Lett. 43 (3) (2015)
Joris Kinable, Frits C. R. Spieksma, Greet Vanden Berghe
School bus routing - a column generation approach. Int. Trans. Oper. Res. 21 (3) (2014)
Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
Mathematical programming models for scheduling locks in sequence. ATMOS (2014)
Bart Smeulders, Frits C. R. Spieksma, Laurens Cherchye, Bram De Rock
Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms. ACM Trans. Economics and Comput. 2 (1) (2014)
Jannes Verstichel, Patrick De Causmaecker, Frits C. R. Spieksma, Greet Vanden Berghe
Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. 235 (2) (2014)
Trivikram Dokka, Yves Crama, Frits C. R. Spieksma
Multi-dimensional vector assignment problems. Discret. Optim. 14 (2014)
Lotte Berghman, Roel Leus, Frits C. R. Spieksma
Optimal solutions for a dock assignment problem with trailer transportation. Ann. Oper. Res. 213 (1) (2014)
Dries R. Goossens, Sander Onderstal, Jan Pijnacker, Frits C. R. Spieksma
Solids: A Combinatorial Auction for Real Estate. Interfaces 44 (4) (2014)
Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma
The Red-Blue transportation problem. Eur. J. Oper. Res. 237 (3) (2014)
Patrick Schittekat, Joris Kinable, Kenneth Sörensen, Marc Sevaux, Frits C. R. Spieksma, Johan Springael
A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229 (2) (2013)
Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato
Balancing profits and costs on trees. Networks 61 (3) (2013)
Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26 (1) (2013)
Pablo A. Maya Duque, Sofie Coene, Peter Goos, Kenneth Sörensen, Frits C. R. Spieksma
The accessibility arc upgrading problem. Eur. J. Oper. Res. 224 (3) (2013)
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. 40 (7) (2013)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
Between a rock and a hard place: the two-to-one assignment problem. Math. Methods Oper. Res. 76 (2) (2012)
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO (2012)
Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. 24 (3) (2012)
Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40 (4) (2012)
Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
Approximating the Multi-level Bottleneck Assignment Problem. WALCOM (2012)
Sofie Coene, Frits C. R. Spieksma, Atri Dutta, Panagiotis Tsiotras
On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies. INFOR Inf. Syst. Oper. Res. 50 (2) (2012)
Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
The interval ordering problem. Discret. Appl. Math. 160 (7-8) (2012)
Dries R. Goossens, Frits C. R. Spieksma
Soccer schedules in Europe: an overview. J. Sched. 15 (5) (2012)
Dries R. Goossens, Jeroen Beliën, Frits C. R. Spieksma
Comparing league formats with respect to match importance in Belgian football. Ann. Oper. Res. 194 (1) (2012)
Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma
Computer-assisted proof of performance ratios for the Differencing Method. Discret. Optim. 9 (1) (2012)
Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA (2012)
Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger
Charlemagne's Challenge: The Periodic Latency Problem. Oper. Res. 59 (3) (2011)
Fabrice Talla Nobibon, Roel Leus, Frits C. R. Spieksma
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms. Eur. J. Oper. Res. 210 (3) (2011)
Dries R. Goossens, Sander Onderstal, Frits C. R. Spieksma
Solids - A Combinatorial Auction for a Housing Corporation. AMMA (2011)
Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
The interval ordering problem CoRR (2011)
Dries R. Goossens, Frits C. R. Spieksma
Breaks, cuts, and patterns. Oper. Res. Lett. 39 (6) (2011)
Sofie Coene, Frits C. R. Spieksma
The Lockmaster's problem. ATMOS (2011)
Dries R. Goossens, Frits C. R. Spieksma
Sports scheduling with generalized breaks. CISched (2011)
Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma
Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. INFORMS J. Comput. 22 (3) (2010)
Frits C. R. Spieksma
Book review. Oper. Res. Lett. 38 (3) (2010)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The Focus of Attention Problem. SODA (2010)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. 4 (1) (2010)
Fabrice Talla Nobibon, Frits C. R. Spieksma
On the complexity of testing the Collective Axiom of Revealed Preference. Math. Soc. Sci. 60 (2) (2010)
Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM (2010)
Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma
Round robin tournaments and three index assignments. 4OR 8 (4) (2010)
Sofie Coene, A. Arnout, Frits C. R. Spieksma
On a periodic vehicle routing problem. J. Oper. Res. Soc. 61 (12) (2010)
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
Heuristics for the Traveling Repairman Problem with Profits. ATMOS (2010)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA (2009)

Frits C. R. Spieksma.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frits C. R. Spieksma