Frits C. R. Spieksma

163 papers A* 2A 2B 16C 9Misc 1Journal 123Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Disjoint Tours and the Price of Diversity. WALCOM Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2026	J	`jnl`	Scheduling cool jobs when processing heats them. J. Sched. Roel Lambers, Rudi Pendavingh, Frits C. R. Spieksma, Céline M. F. Swennenhuis
2026	J	`jnl`	Stable and Dynamic Minimum Cuts. J. Graph Algorithms Appl. Andrés López Martínez, Mark de Berg, Frits C. R. Spieksma
2025	C	`conf`	Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study. ATMOS Christopher Hojny, Frits C. R. Spieksma, Sten Wessel
2025	J	`jnl`	Fair Schedules for Single Round Robin Tournaments with Ranked Participants. CoRR Sten Wessel, Cor A. J. Hurkens, Frits C. R. Spieksma
2025	J	`jnl`	Fairness in graph-theoretical optimization problems. Discret. Appl. Math. Christopher Hojny, Frits C. R. Spieksma, Sten Wessel
2025	B	`conf`	Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. ISAAC Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2025	J	`jnl`	Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2025	J	`jnl`	How to Design a Stable Serial Knockout Competition. Math. Oper. Res. Roel Lambers, Rudi Pendavingh, Frits C. R. Spieksma
2025	J	`jnl`	Learning by Doing: The Industrial and Applied Mathematics Program at Eindhoven University of Technology. INFORMS J. Appl. Anal. Alessandro Di Bucchianico, Frits C. R. Spieksma, Maria Vlasiou
2025	J	`jnl`	On queens and tours. Oper. Res. Lett. Pieter Jacobs, Andrés López Martínez, Frits C. R. Spieksma
2025	J	`jnl`	Scheduling (Dagstuhl Seminar 25121). Dagstuhl Reports Claire Mathieu, Nicole Megow, Benjamin Moseley, Frits C. R. Spieksma, Alexander Lindermayr
2025	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2025	J	`jnl`	The ETKidney simulator: a discrete event simulator to assess the impact of alternative kidney allocation rules in Eurotransplant. CoRR H. C. de Ferrante, Rocio Laguna Goya, Bart M. L. Smeulders, Frits C. R. Spieksma, Ineke Tieken
2025	J	`jnl`	The Price of Diversity of the Traveling Salesman Problem. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2024	J	`jnl`	A discrete event simulator for policy evaluation in liver allocation in Eurotransplant. CoRR Hans de Ferrante, Marieke de Rosner-Van Rosmalen, Bart Smeulders, Frits C. R. Spieksma, Serge Vogelaar
2024	—	`conf`	Fairness in Graph-theoretical Optimization Problems. EWAF Christopher Hojny, Frits C. R. Spieksma, Sten Wessel
2024	J	`jnl`	Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete. Math. Program. Bart Smeulders, Danny Blom, Frits C. R. Spieksma
2024	J	`jnl`	Rejection-proof mechanisms for multi-agent kidney exchange. Games Econ. Behav. Danny Blom, Bart Smeulders, Frits C. R. Spieksma
2024	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	B	`conf`	Stable and Dynamic Minimum Cuts. WALCOM Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2023	B	`conf`	Finding Diverse Minimum s-t Cuts. ISAAC Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2023	J	`jnl`	Finding Diverse Minimum s-t Cuts. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2023	J	`jnl`	Integer programming models for round robin tournaments. Eur. J. Oper. Res. Jasper van Doornmalen, Christopher Hojny, Roel Lambers, Frits C. R. Spieksma
2023	J	`jnl`	Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz
2023	A	`conf`	Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2023	J	`jnl`	The flexibility of home away pattern sets. J. Sched. Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma
2022	J	`jnl`	A project scheduling problem with periodically aggregated resource-constraints. Comput. Oper. Res. Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma
2022	J	`jnl`	Filling a Theater During the COVID-19 Pandemic. INFORMS J. Appl. Anal. Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma
2022	J	`jnl`	In memoriam Gerhard Woeginger. Oper. Res. Lett. Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
2022	J	`jnl`	In memoriam Gerhard Woeginger. J. Sched. Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
2022	J	`jnl`	Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. Algorithms Kelin Luo, Frits C. R. Spieksma
2022	J	`jnl`	Obituary for Gerhard Woeginger. Bull. EATCS Frits C. R. Spieksma
2022	B	`conf`	Package Delivery Using Drones with Restricted Movement Areas. ISAAC Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022	J	`jnl`	Package Delivery Using Drones with Restricted Movement Areas. CoRR Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022	J	`jnl`	Parliament seating assignment problems. Eur. J. Oper. Res. Bart Vangerven, Dirk Briskorn, Dries R. Goossens, Frits C. R. Spieksma
2022	J	`jnl`	Recourse in Kidney Exchange Programs. INFORMS J. Comput. Bart Smeulders, Valentin Bartier, Yves Crama, Frits C. R. Spieksma
2022	J	`jnl`	Rejection-proof Kidney Exchange Mechanisms. CoRR Danny Blom, Bart Smeulders, Frits C. R. Spieksma
2022	—	`conf`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2021	J	`jnl`	A note on equitable Hamiltonian cycles. Discret. Appl. Math. Tim Ophelders, Roel Lambers, Frits C. R. Spieksma, Tjark Vredeveld
2021	J	`jnl`	Modelling and optimisation in European Kidney Exchange Programmes. Eur. J. Oper. Res. 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
2021	—	`conf`	Online Bin Packing with Overload Cost. CALDAM Kelin Luo, Frits C. R. Spieksma
2021	J	`jnl`	Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. RAIRO Oper. Res. Lotte Berghman, Frits C. R. Spieksma, Vincent T'kindt
2021	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2021	B	`conf`	The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. CPAIOR Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma
2021	J	`jnl`	The transportation problem with conflicts. Ann. Oper. Res. Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2021	J	`jnl`	Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions. Bus. Inf. Syst. Eng. Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma
2020	Misc	`conf`	Approximation Algorithms for Car-Sharing Problems. COCOON Kelin Luo, Frits C. R. Spieksma
2020	J	`jnl`	Approximation algorithms for car-sharing problems. CoRR Kelin Luo, Frits C. R. Spieksma
2020	J	`jnl`	Filling a theatre in times of corona. CoRR Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma
2020	J	`jnl`	The Stackelberg Kidney Exchange Problem is Σ CoRR Bart Smeulders, Danny Blom, Frits C. R. Spieksma
2020	J	`jnl`	The multi-league sports scheduling problem, or how to schedule thousands of matches. Oper. Res. Lett. Morteza Davari, Dries R. Goossens, Jeroen Beliën, Roel Lambers, Frits C. R. Spieksma
2019	J	`jnl`	No-Wait Scheduling for Locks. INFORMS J. Comput. Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
2019	J	`jnl`	Online interval scheduling on two related machines: the power of lookahead. J. Comb. Optim. Nicolas Pinson, Frits C. R. Spieksma
2019	J	`jnl`	Revealed preference theory: An algorithmic outlook. Eur. J. Oper. Res. Bart Smeulders, Yves Crama, Frits C. R. Spieksma
2019	J	`jnl`	Scheduling a non-professional indoor football league: a tabu search based approach. Ann. Oper. Res. David Van Bulck, Dries R. Goossens, Frits C. R. Spieksma
2019	J	`jnl`	Scheduling parallel batching machines in a sequence. J. Sched. Ward Passchyn, Frits C. R. Spieksma
2019	J	`jnl`	The sport teams grouping problem. Ann. Oper. Res. Túlio A. M. Toffolo, Jan Christiaens, Frits C. R. Spieksma, Greet Vanden Berghe
2018	B	`conf`	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
2018	J	`jnl`	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
2018	J	`jnl`	Robust balanced optimization. EURO J. Comput. Optim. Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2018	J	`jnl`	Round-robin tournaments generated by the Circle Method have maximum carry-over. Math. Program. Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
2018	J	`jnl`	Testing probabilistic models of choice using column generation. Comput. Oper. Res. Bart Smeulders, Clintin P. Davis-Stober, Michel Regenwetter, Frits C. R. Spieksma
2017	J	`jnl`	Exact algorithms for the Equitable Traveling Salesman Problem. Eur. J. Oper. Res. Joris Kinable, Bart Smeulders, Eline Delcour, Frits C. R. Spieksma
2017	J	`jnl`	Fast separation for the three-index assignment problem. Math. Program. Comput. Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
2017	J	`jnl`	Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015). J. Sched. Yves Crama, Dries R. Goossens, Roel Leus, Michaël Schyns, Frits C. R. Spieksma
2017	J	`jnl`	Winner determination in geometrical combinatorial auctions. Eur. J. Oper. Res. Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma
2016	B	`conf`	Balanced Optimization with Vector Costs. WAOA Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2016	J	`jnl`	Facets of the axial three-index assignment polytope. Discret. Appl. Math. Trivikram Dokka, Frits C. R. Spieksma
2016	J	`jnl`	Mathematical programming models for lock scheduling with an emission objective. Eur. J. Oper. Res. Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
2016	J	`jnl`	Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms. Oper. Res. Fabrice Talla Nobibon, Laurens Cherchye, Yves Crama, Thomas Demuynck, Bram De Rock, Frits C. R. Spieksma
2016	B	`conf`	Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. IPCO Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
2016	J	`jnl`	The Focus of Attention Problem. Algorithmica Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2016	J	`jnl`	The lockmaster's problem. Eur. J. Oper. Res. Ward Passchyn, Sofie Coene, Dirk Briskorn, Johann L. Hurink, Frits C. R. Spieksma, Greet Vanden Berghe
2015	J	`jnl`	A Note on Testing Axioms of Revealed Preference. J. Optim. Theory Appl. Fabrice Talla Nobibon, Bart Smeulders, Frits C. R. Spieksma
2015	J	`jnl`	Valid inequalities for a time-indexed formulation. Oper. Res. Lett. Lotte Berghman, Frits C. R. Spieksma
2014	J	`jnl`	Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. Jannes Verstichel, Patrick De Causmaecker, Frits C. R. Spieksma, Greet Vanden Berghe
2014	J	`jnl`	Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms. ACM Trans. Economics and Comput. Bart Smeulders, Frits C. R. Spieksma, Laurens Cherchye, Bram De Rock
2014	C	`conf`	Mathematical programming models for scheduling locks in sequence. ATMOS Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma
2014	J	`jnl`	Multi-dimensional vector assignment problems. Discret. Optim. Trivikram Dokka, Yves Crama, Frits C. R. Spieksma
2014	J	`jnl`	Optimal solutions for a dock assignment problem with trailer transportation. Ann. Oper. Res. Lotte Berghman, Roel Leus, Frits C. R. Spieksma
2014	J	`jnl`	School bus routing - a column generation approach. Int. Trans. Oper. Res. Joris Kinable, Frits C. R. Spieksma, Greet Vanden Berghe
2014	J	`jnl`	Solids: A Combinatorial Auction for Real Estate. Interfaces Dries R. Goossens, Sander Onderstal, Jan Pijnacker, Frits C. R. Spieksma
2014	J	`jnl`	The Red-Blue transportation problem. Eur. J. Oper. Res. Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma
2013	J	`jnl`	A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. Patrick Schittekat, Joris Kinable, Kenneth Sörensen, Marc Sevaux, Frits C. R. Spieksma, Johan Springael
2013	J	`jnl`	Balancing profits and costs on trees. Networks Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato
2013	J	`jnl`	Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
2013	J	`jnl`	The accessibility arc upgrading problem. Eur. J. Oper. Res. Pablo A. Maya Duque, Sofie Coene, Peter Goos, Kenneth Sörensen, Frits C. R. Spieksma
2013	J	`jnl`	The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2012	B	`conf`	Approximating the Multi-level Bottleneck Assignment Problem. WALCOM Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
2012	J	`jnl`	Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
2012	B	`conf`	Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
2012	J	`jnl`	Between a rock and a hard place: the two-to-one assignment problem. Math. Methods Oper. Res. Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2012	J	`jnl`	Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
2012	J	`jnl`	Comparing league formats with respect to match importance in Belgian football. Ann. Oper. Res. Dries R. Goossens, Jeroen Beliën, Frits C. R. Spieksma
2012	J	`jnl`	Computer-assisted proof of performance ratios for the Differencing Method. Discret. Optim. Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma
2012	C	`conf`	Fast Separation Algorithms for Three-Index Assignment Problems. ISCO Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
2012	J	`jnl`	On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies. INFOR Inf. Syst. Oper. Res. Sofie Coene, Frits C. R. Spieksma, Atri Dutta, Panagiotis Tsiotras
2012	J	`jnl`	Soccer schedules in Europe: an overview. J. Sched. Dries R. Goossens, Frits C. R. Spieksma
2012	J	`jnl`	The interval ordering problem. Discret. Appl. Math. Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
2011	J	`jnl`	Breaks, cuts, and patterns. Oper. Res. Lett. Dries R. Goossens, Frits C. R. Spieksma
2011	J	`jnl`	Charlemagne's Challenge: The Periodic Latency Problem. Oper. Res. Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger
2011	J	`jnl`	Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms. Eur. J. Oper. Res. Fabrice Talla Nobibon, Roel Leus, Frits C. R. Spieksma
2011	—	`conf`	Solids - A Combinatorial Auction for a Housing Corporation. AMMA Dries R. Goossens, Sander Onderstal, Frits C. R. Spieksma
2011	—	`conf`	Sports scheduling with generalized breaks. CISched Dries R. Goossens, Frits C. R. Spieksma
2011	C	`conf`	The Lockmaster's problem. ATMOS Sofie Coene, Frits C. R. Spieksma
2011	J	`jnl`	The interval ordering problem CoRR Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
2010	J	`jnl`	Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. INFORMS J. Comput. Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma
2010	J	`jnl`	Book review. Oper. Res. Lett. Frits C. R. Spieksma
2010	C	`conf`	Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
2010	C	`conf`	Heuristics for the Traveling Repairman Problem with Profits. ATMOS Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
2010	J	`jnl`	On a periodic vehicle routing problem. J. Oper. Res. Soc. Sofie Coene, A. Arnout, Frits C. R. Spieksma
2010	J	`jnl`	On the complexity of testing the Collective Axiom of Revealed Preference. Math. Soc. Sci. Fabrice Talla Nobibon, Frits C. R. Spieksma
2010	J	`jnl`	Round robin tournaments and three index assignments. 4OR Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma
2010	A*	`conf`	The Focus of Attention Problem. SODA Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2010	J	`jnl`	The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2009	B	`conf`	Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2009	J	`jnl`	Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res. Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic
2009	J	`jnl`	Exact algorithms for the matrix bid auction. Comput. Oper. Res. Dries R. Goossens, Frits C. R. Spieksma
2009	—	`ch.`	Multi-index Transportation Problems. Encyclopedia of Optimization Maurice Queyranne, Frits C. R. Spieksma
2009	J	`jnl`	Scheduling the Belgian Soccer League. Interfaces Dries R. Goossens, Frits C. R. Spieksma
2009	J	`jnl`	The transportation problem with exclusionary side constraints. 4OR Dries R. Goossens, Frits C. R. Spieksma
2008	J	`jnl`	A note on a motion control problem for a placement machine. OR Spectr. Sofie Coene, Nguyen Van Hop, Joris van de Klundert, Frits C. R. Spieksma
2008	J	`jnl`	Counting and enumerating aggregate classifiers. Discret. Appl. Math. Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma
2008	J	`jnl`	Partitioning a weighted partial order. J. Comb. Optim. Linda S. Moonen, Frits C. R. Spieksma
2008	J	`jnl`	Profit-based latency problems on the line. Oper. Res. Lett. Sofie Coene, Frits C. R. Spieksma
2007	—	`ch.`	A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem. Handbook of Approximation Algorithms and Metaheuristics Frits C. R. Spieksma, Sofia Kovaleva
2007	C	`conf`	A latency problem with profits. CTW Sofie Coene, Frits C. R. Spieksma
2007	—	`conf`	Exact Algorithms for the Matrix Bid Auction. WEA Dries R. Goossens, Frits C. R. Spieksma
2007	J	`jnl`	Exact algorithms for procurement problems under a total quantity discount structure. Eur. J. Oper. Res. Dries R. Goossens, A. J. T. Maas, Frits C. R. Spieksma, Joris van de Klundert
2007	J	`jnl`	The tool switching problem revisited. Eur. J. Oper. Res. Yves Crama, Linda S. Moonen, Frits C. R. Spieksma, Ellen Talloen
2006	J	`jnl`	Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. SIAM J. Discret. Math. Sofia Kovaleva, Frits C. R. Spieksma
2006	J	`jnl`	Exact Algorithms for a Loading Problem with Bounded Clique Width. INFORMS J. Comput. Linda S. Moonen, Frits C. R. Spieksma
2006	J	`jnl`	Modeling and solving the periodic maintenance problem. Eur. J. Oper. Res. Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma
2006	—	`conf`	Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic
2005	J	`jnl`	Selecting Telecommunication Carriers to Obtain Volume Discounts. Interfaces Joris van de Klundert, Jeroen Kuipers, Frits C. R. Spieksma, Maarten Winkels
2005	J	`jnl`	The no-wait flow-shop paradox. Oper. Res. Lett. Frits C. R. Spieksma, Gerhard J. Woeginger
2004	A	`conf`	Approximation of Rectangle Stabbing and Interval Stabbing Problems. ESA Sofia Kovaleva, Frits C. R. Spieksma
2004	J	`jnl`	Local search heuristics for multi-index assignment problems with decomposable costs. J. Oper. Res. Soc. Hans-Jürgen Bandelt, A. J. T. Maas, Frits C. R. Spieksma
2003	J	`jnl`	An LP-based algorithm for the data association problem in multitarget tracking. Comput. Oper. Res. Patrick P. A. Storms, Frits C. R. Spieksma
2003	C	`conf`	Approximation of a Retrieval Problem for Parallel Disks. CIAC Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
2003	J	`jnl`	Interval selection: Applications, algorithms, and lower bounds. J. Algorithms Thomas Erlebach, Frits C. R. Spieksma
2003	J	`jnl`	Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. IEEE Trans. Computers Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger
2002	J	`jnl`	Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO Oper. Res. Sofia Kovaleva, Frits C. R. Spieksma
2002	J	`jnl`	Production planning problems in printed circuit board assembly. Discret. Appl. Math. Yves Crama, Joris van de Klundert, Frits C. R. Spieksma
2001	J	`jnl`	A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. Math. Oper. Res. S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
2001	B	`conf`	Approximation of a Geometric Set Covering Problem. ISAAC Sofia Kovaleva, Frits C. R. Spieksma
2001	J	`jnl`	The clique partitioning problem: Facets and patching facets. Networks Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma
2000	B	`conf`	Simple Algorithms for a Weighted Interval Selection Problem. ISAAC Thomas Erlebach, Frits C. R. Spieksma
2000	J	`jnl`	Solving a bi-criterion cutting stock problem with open-ended demand: a case study. J. Oper. Res. Soc. Antoon W. J. Kolen, Frits C. R. Spieksma
1999	J	`jnl`	Lifting theorems and facet characterization for a class of clique partitioning inequalities. Oper. Res. Lett. Hans-Jürgen Bandelt, Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma
1998	J	`jnl`	A General Class of Greedily Solvable Linear Programs. Math. Oper. Res. Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella
1998	—	`conf`	Approximating an Interval Scheduling Problem. APPROX Frits C. R. Spieksma
1997	J	`jnl`	Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. Discret. Appl. Math. Maurice Queyranne, Frits C. R. Spieksma
1997	A*	`conf`	Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
1996	J	`jnl`	Scheduling jobs of equal length: compleixty, facets and computational results. Math. Program. Yves Crama, Frits C. R. Spieksma
1995	C	`conf`	Boltzmann Machines. Artificial Neural Networks Frits C. R. Spieksma
1995	B	`conf`	Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. IPCO Yves Crama, Frits C. R. Spieksma
1995	J	`jnl`	Scheduling with safety distances. Ann. Oper. Res. Frits C. R. Spieksma, Gerhard J. Woeginger, Zhongliang Yu
1994	J	`jnl`	A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput. Oper. Res. Frits C. R. Spieksma
1994	J	`jnl`	Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. Discret. Appl. Math. Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma
1993	B	`conf`	A general class of greedily solvable linear programs. IPCO Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella