Frits C. R. Spieksma

Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen: Heuristics for the traveling repairman problem with profits. Computers & OR 40(7): 1700-1707 (2013)

Pablo A. Maya Duque, Sofie Coene, Peter Goos, Kenneth Sörensen, Frits C. R. Spieksma: The accessibility arc upgrading problem. European Journal of Operational Research 224(3): 458-465 (2013)

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. European Journal of Operational Research 229(2): 518-528 (2013)

Dries R. Goossens, Jeroen Beliën, Frits C. R. Spieksma: Comparing league formats with respect to match importance in Belgian football. Annals OR 194(1): 223-240 (2012)

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. Discrete Applied Mathematics 160(7-8): 1094-1103 (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. Discrete Optimization 9(1): 1-16 (2012)

Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma: Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS Journal on Computing 24(3): 485-499 (2012)

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. Meth. of OR 76(2): 223-237 (2012)

Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma: Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40(4): 282-286 (2012)

Dries R. Goossens, Frits C. R. Spieksma: Soccer schedules in Europe: an overview. J. Scheduling 15(5): 641-651 (2012)

Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma: Fast Separation Algorithms for Three-Index Assignment Problems. ISCO 2012: 189-200

Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma: Approximating the Multi-level Bottleneck Assignment Problem. WALCOM 2012: 64-75

Fabrice Talla Nobibon, Roel Leus, Frits C. R. Spieksma: Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms. European Journal of Operational Research 210(3): 670-683 (2011)

Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger: Charlemagne's Challenge: The Periodic Latency Problem. Operations Research 59(3): 674-683 (2011)

Dries R. Goossens, Frits C. R. Spieksma: Breaks, cuts, and patterns. Oper. Res. Lett. 39(6): 428-432 (2011)

Dries R. Goossens, Sander Onderstal, Frits C. R. Spieksma: Solids - A Combinatorial Auction for a Housing Corporation. AMMA 2011: 76-87

Sofie Coene, Frits C. R. Spieksma: The Lockmaster's problem. ATMOS 2011: 27-37

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. CoRR abs/1112.0534 (2011)

Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma: Round robin tournaments and three index assignments. 4OR 8(4): 365-374 (2010)

Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma: Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. INFORMS Journal on Computing 22(3): 339-352 (2010)

Sofie Coene, A. Arnout, Frits C. R. Spieksma: On a periodic vehicle routing problem. JORS 61(12): 1719-1728 (2010)

Fabrice Talla Nobibon, Frits C. R. Spieksma: On the complexity of testing the Collective Axiom of Revealed Preference. Mathematical Social Sciences 60(2): 123-136 (2010)

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: The approximability of three-dimensional assignment problems with bottleneck objective. Optimization Letters 4(1): 7-16 (2010)

Frits C. R. Spieksma: Book review. Oper. Res. Lett. 38(3): 240 (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: 229-242

Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen: Heuristics for the Traveling Repairman Problem with Profits. ATMOS 2010: 34-44

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: The Focus of Attention Problem. SODA 2010: 312-317

Dries R. Goossens, Frits C. R. Spieksma: The transportation problem with exclusionary side constraints. 4OR 7(1): 51-60 (2009)

Dries R. Goossens, Frits C. R. Spieksma: Exact algorithms for the matrix bid auction. Computers & OR 36(4): 1090-1109 (2009)

Dries R. Goossens, Frits C. R. Spieksma: Scheduling the Belgian Soccer League. Interfaces 39(2): 109-118 (2009)

Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic: Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Operations Research 57(4): 1006-1025 (2009)

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: 159-169

Maurice Queyranne, Frits C. R. Spieksma: Multi-index Transportation Problems. Encyclopedia of Optimization 2009: 2413-2419

Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma: Counting and enumerating aggregate classifiers. Discrete Applied Mathematics 156(13): 2459-2468 (2008)

Linda S. Moonen, Frits C. R. Spieksma: Partitioning a weighted partial order. J. Comb. Optim. 15(4): 342-356 (2008)

Sofie Coene, Frits C. R. Spieksma: Profit-based latency problems on the line. Oper. Res. Lett. 36(3): 333-337 (2008)

Dries R. Goossens, A. J. T. Maas, Frits C. R. Spieksma, Joris van de Klundert: Exact algorithms for procurement problems under a total quantity discount structure. European Journal of Operational Research 178(2): 603-626 (2007)

Yves Crama, Linda S. Moonen, Frits C. R. Spieksma, Ellen Talloen: The tool switching problem revisited. European Journal of Operational Research 182(2): 952-957 (2007)

Sofie Coene, Frits C. R. Spieksma: A latency problem with profits. CTW 2007: 29-32

Dries R. Goossens, Frits C. R. Spieksma: Exact Algorithms for the Matrix Bid Auction. WEA 2007: 433-445

Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma: Modeling and solving the periodic maintenance problem. European Journal of Operational Research 172(3): 783-797 (2006)

Linda S. Moonen, Frits C. R. Spieksma: Exact Algorithms for a Loading Problem with Bounded Clique Width. INFORMS Journal on Computing 18(4): 455-465 (2006)

Sofia Kovaleva, Frits C. R. Spieksma: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. SIAM J. Discrete Math. 20(3): 748-768 (2006)

Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic: Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274

Joris van de Klundert, Jeroen Kuipers, Frits C. R. Spieksma, Maarten Winkels: Selecting Telecommunication Carriers to Obtain Volume Discounts. Interfaces 35(2): 124-132 (2005)

Lodewijk C. M. Kallenberg, Ger Koole, Frits C. R. Spieksma: Special issue in honor of Arie Hordijk Editorial introduction. Math. Meth. of OR 62(3): 347-349 (2005)

Frits C. R. Spieksma, Gerhard J. Woeginger: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005)

Sofia Kovaleva, Frits C. R. Spieksma: Approximation of Rectangle Stabbing and Interval Stabbing Problems. ESA 2004: 426-435

Patrick P. A. Storms, Frits C. R. Spieksma: An LP-based algorithm for the data association problem in multitarget tracking. Computers & OR 30(7): 1067-1085 (2003)

Thomas Erlebach, Frits C. R. Spieksma: Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46(1): 27-53 (2003)

Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger: Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. IEEE Trans. Computers 52(9): 1210-1214 (2003)

Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma: Approximation of a Retrieval Problem for Parallel Disks. CIAC 2003: 178-188

Yves Crama, Joris van de Klundert, Frits C. R. Spieksma: Production planning problems in printed circuit board assembly. Discrete Applied Mathematics 123(1-3): 339-361 (2002)

Sofia Kovaleva, Frits C. R. Spieksma: Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO - Operations Research 36(1): 53-71 (2002)

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. Math. Oper. Res. 26(1): 31-49 (2001)

Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma: The clique partitioning problem: Facets and patching facets. Networks 38(4): 209-226 (2001)

Sofia Kovaleva, Frits C. R. Spieksma: Approximation of a Geometric Set Covering Problem. ISAAC 2001: 493-501

Thomas Erlebach, Frits C. R. Spieksma: Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240

Hans-Jürgen Bandelt, Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma: Lifting theorems and facet characterization for a class of clique partitioning inequalities. Oper. Res. Lett. 24(5): 235-243 (1999)

Frits C. R. Spieksma: Approximating an Interval Scheduling Problem. APPROX 1998: 169-180

Maurice Queyranne, Frits C. R. Spieksma: Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. Discrete Applied Mathematics 76(1-3): 239-253 (1997)

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma: Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA 1997: 509-517

Yves Crama, Frits C. R. Spieksma: Scheduling jobs of equal length: compleixty, facets and computational results. Math. Program. 72: 207-227 (1996)

Frits C. R. Spieksma: Boltzmann Machines. Artificial Neural Networks 1995: 119-129

Yves Crama, Frits C. R. Spieksma: Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. IPCO 1995: 277-291

Frits C. R. Spieksma: A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & OR 21(1): 19-25 (1994)

Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma: Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. Discrete Applied Mathematics 49(1-3): 25-50 (1994)

Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella: A general class of greedily solvable linear programs. IPCO 1993: 385-399