publications

Journal Publications

To appear:

Coene, S., C. Filippi, F.C.R. Spieksma, and E. Stevanato, Balancing profits and costs on trees, accepted for Networks.

Dürr, C., M. Queyranne, F.C.R. Spieksma, F. Talla Nobibon, and G.J. Woeginger, The interval ordering problem, accepted for Discrete Applied Mathematics.

Polyakovskiy, S., F.C.R. Spieksma, and G.J. Woeginger, The three-dimensional matching problem in Kalmanson matrices, accepted for the Journal of Combinatorial Optimization.

Michiels, W., E. Aarts, J. Korst, J. van Leeuwen, and F.C.R. Spieksma, Computer-assisted proof of performance ratios for the Differencing Method, accepted for Discrete Optimization.

Berghman, L., Leus, R., and F.C.R. Spieksma, Optimal solutions for a dock assignment problem with trailer transportation, accepted for Annals of Operations Research.

Goossens, D. and F.C.R. Spieksma, Soccer schedules in Europe: an overview, accepted for the Journal of Scheduling.

Talla Nobibon, F., C. Hurkens, R. Leus, and F.C.R. Spieksma, Coloring graphs using two colors while avoiding monochromatic cycles, accepted for the INFORMS Journal on Computing.

Goossens, D., and F.C.R. Spieksma, The carry-over effect does not influence football results, accepted for the Journal of Sports Economics.

Belien, J., D. Goossens, and F.C.R. Spieksma, Comparing league formats with respect to match unimportance in Belgian football, accepted for Annals of Operations Research.

2011:

Goossens, D. and F.C.R. Spieksma, Breaks, cuts, and patterns, Operations Research Letters 39, 428-432. (pdf)

Coene, S., F.C.R. Spieksma, and G.J. Woeginger, Charlemagne's challenge: the periodic latency problem, Operations Research 59, 674-683. (pdf)

Talla Nobibon, F., L. Cherchye, B. De Rock, J. Sabbe, and F.C.R. Spieksma, Heuristics for deciding collectively rational consumption behavior, Computational Economics 38, 173-204. (pdf)

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

2010:

Briskorn, D., A. Drexl, and F.C.R. Spieksma, Round robin tournaments and three index assignments, 4OR 8, 365-374.(pdf)

Coene, S., A. Arnout, and F.C.R. Spieksma, On a periodic vehicle routing problem, Journal of the Operational Research Society 61, 1719-1728. (pdf)

Talla Nobibon, F. and F.C.R. Spieksma, On the complexity of testing the Collective Axiom of Revealed Preference, Mathematical Social Sciences 20, 123-136. (pdf)

Goossens, D.R., R. Müller, and F.C.R. Spieksma, Algorithms for recognizing economic properties in matrix bid combinatorial auctions, INFORMS Journal on Computing 22, 339-352. (pdf)

Goossens, D., S. Polyakovskiy, F.C.R. Spieksma, and G.J. Woeginger, The approximability of three-dimensional assignment problems with bottleneck objective, Optimization Letters 4, 7-16. (pdf)

2009:

Erlebach, T., L. Moonen, F.C.R. Spieksma, and D. Vukadinovic, Connectivity Measures for Internet Topologies on the Level of Autonomous Systems, Operations Research 57, 1006-1025. (pdf)

Goossens, D. and F.C.R. Spieksma, Scheduling the Belgian soccer league, Interfaces 39, 109-118. (pdf)

Goossens, D. and F.C.R. Spieksma, The transportation problem with exclusionary side constraints, 4OR 7, 51-60.(pdf)

Goossens, D. and F.C.R. Spieksma, Exact algorithms for the matrix bid auction, Computers and Operations Research 36, 1090-1109. (pdf)

2008:

Adem, J., Y. Crama, W. Gochet, and F.C.R. Spieksma, Counting and enumerating aggregate classifiers, Discrete Applied Mathematics 156, 2459-2468. (pdf)

Coene, S. and F.C.R. Spieksma, Profit-based latency problems on the line, Operations Research Letters 36, 333-337. (pdf)

Coene, S., N. Hop, J. van de Klundert, and F.C.R. Spieksma, A note on a motion control problem for a placement machine, Operations Research Spectrum 30, 535-549. (pdf)

Moonen, L.S. and F.C.R. Spieksma, Partitioning a weighted partial order, Journal of Combinatorial Optimization 15, 342-356. (pdf)

2007:

Kolen, A.W.J, C.H. Papadimitriou, J.K. Lenstra, and F.C.R. Spieksma, Interval Scheduling: A Survey, Naval Research Logistics 54, 530-543. (pdf)

Bouhtou, M., A. Grigoriev, S. van Hoesel, A.F. van der Kraaij, F.C.R. Spieksma, and M. Uetz, Pricing bridges to cross a river, Naval Research Logistics 54, 411-420. (pdf)

Oosten, M., J.H.G.C. Rutten, and F.C.R. Spieksma, Disconnecting graphs by removing vertices: a polyhedral approach, Statistica Neerlandica 61, 35-60. (pdf)

Crama, Y., L.S. Moonen, F.C.R. Spieksma, and E. Talloen, The tool switching problem revisited, European Journal of Operational Research 182, 952-957.(pdf)

Goossens, D.R., A.J.T. Maas, F.C.R. Spieksma, and J.J. van de Klundert, Exact algorithms for a procurement problem with total quantity discounts, European Journal of Operational Research 178, 603-626. (pdf)

2006:

Kovaleva, S. and F.C.R. Spieksma, Approximation algorithms for rectangle stabbing and interval stabbing problems, SIAM Journal on Discrete Mathematics 20, 748-768. (pdf)

Moonen, L.S. and F.C.R. Spieksma, Exact algorithms for a loading problem with bounded clique width, INFORMS Journal on Computing 18, 455-465. (pdf)

Grigoriev, A., J.J. van de Klundert, and F.C.R. Spieksma, Modeling and solving the periodic maintenance problem, European Journal of Operational Research 172, 783-797. (pdf)

2005:

Spieksma, F.C.R. and G.J. Woeginger, The no-wait flow-shop paradox, Operations Research Letters 33, 603-608. (pdf)

Klundert, J. van de, J. Kuipers, F.C.R. Spieksma, and M. Winkels, Selecting telecommunication carriers to obtain volume discounts, Interfaces 35, 124-132. (pdf)

2004:

Bandelt, H.-J., A. Maas, and F.C.R. Spieksma, Local search heuristics for multi-index assignment problems, Journal of the Operational Research Society 55, 694-704. (pdf)

2003:

Spieksma, F.C.R., Over versnijden, volgorde’s, en veilingen: combinatorisch optimaliseren in de praktijk, Tijdschrift voor Economie en Management 48, 97-118. (pdf)

Storms, P.P.A. and F.C.R. Spieksma, An LP-based algorithm for the data association problem in multi-target tracking, Computers and Operations Research 30, 1067-1085. (pdf)

Aerts, J., J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger, Random redundant storage in disk arrays: complexity of retrieval problems, IEEE Transactions on Computers 52, 1210-1214. (pdf)

Erlebach, T. and F.C.R. Spieksma, Interval selection: applications, algorithms and lower bounds, Journal of Algorithms 46, 27-53. (pdf)

2002:

Faneyte, D.B.C., F.C.R. Spieksma, and G.J. Woeginger, A branch-and-price algorithm for a hierarchical crew scheduling problem, Naval Research Logistics 49, 743-759. (pdf)

Crama, Y., J.J. van de Klundert, and F.C.R. Spieksma, Production planning problems in printed circuit board assembly, Discrete Applied Mathematics 123, 339-361. (pdf)

Kovaleva, S. and F.C.R. Spieksma, Primal-dual approximation algorithms for a packing-covering pair of problems, RAIRO-Récherche Opérationelle 36, 53-72. (pdf)

2001:

Oosten, M., J.H.G.C. Rutten, and F.C.R. Spieksma, The clique partitioning problem: facets and patching facets, Networks 38, 209-226. (pdf)

McCormick, S.T., S.R. Smallwood, and F.C.R. Spieksma, A polynomial algorithm for multiprocessor scheduling with two job lenghts, Mathematics of Operations Research 26, 31-49. (pdf)

2000:

Kolen, A.W.J. and F.C.R. Spieksma, Solving a bi-criterion cutting stock problem with open-ended demand: a case study, Journal of the Operational Research Society 51, 1238-1247.(pdf)

Klomp, C., J.J. van de Klundert, F.C.R. Spieksma, and S. Voogt, The feeder rack assignment problem in PCB assembly: a case study, International Journal of Production Economics 64, 399-407. (pdf)

1999:

Bandelt, H.-J., M. Oosten, J.H.G.C. Rutten, and F.C.R. Spieksma, Lifting theorems and facet characterization for a class of clique partitioning inequalities, Operations Research Letters 24, 235-243. (pdf)

Spieksma, F.C.R., On the approximability of an interval scheduling problem, Journal of Scheduling 2 , 215-227. (pdf)

1998:

Queyranne, M., F.C.R. Spieksma and F. Tardella, A general class of greedily solvable linear programs, Mathematics of Operations Research 23, 892-908. (pdf)

1997:

Crama, Y., O.E. Flippo, J.J. van de Klundert, and F.C.R. Spieksma, The assembly of printed circuit boards: a case with multiple machines and multiple board types, European Journal of Operational Research 98, 457-472. (pdf)

Queyranne, M. and F.C.R. Spieksma, Approximation algorithms for multi-index transportation problems with decomposable costs, Discrete Applied Mathematics 76, 239-254. (pdf)

1996:

Crama, Y., O.E. Flippo, J.J. van de Klundert, and F.C.R. Spieksma, The component retrieval problem in printed circuit board assembly, The International Journal of Flexible Manufacturing Systems 8, 287-312. (pdf)

Spieksma, F.C.R. and G.J. Woeginger, Geometric three-dimensional assignment problems, European Journal of Operational Research 91, 611-618. (pdf)

Derks, J.J.M. and F.C.R. Spieksma, A decision support system for locating facilities and routing traffic on a factory site, Belgian Journal of Operations Research, Statistics, and Computer Science 36, 173-184. (pdf)

Crama, Y. and F.C.R. Spieksma, Scheduling jobs of equal length: complexity, facets and computational results, Mathematical Programming 72, 207-227. (pdf)

1995:

Spieksma, F.C.R., G.J. Woeginger, and Z. Yu, Scheduling with safety distances, Annals of Operations Research (Mathematics of Industrial Systems) 57, 251-264. (pdf)

1994:

Spieksma, F.C.R. and G.J. Woeginger, The computational complexity of a bin packing game, Central European Journal for Operations Research and Economics 3, 39-49. (pdf)

Bandelt, H.-J., Y. Crama and F.C.R. Spieksma, Approximation algorithms for multidimensional assignment problems with decomposable costs, Discrete Applied Mathematics 49, 25-50. (pdf)

Spieksma, F.C.R., A branch-and-bound algorithm for the two-dimensional vector packing problem, Computers and Operations Research 21, 19-25. (pdf)

Crama, Y., A.W.J. Kolen, A.G. Oerlemans, and F.C.R. Spieksma, Minimizing the number of tool switches on a flexible machine, The International Journal of Flexible Manufacturing Systems 6, 33-54. (pdf)
(This paper contains computational experiments on instances that can be found here: instancesIJFMS.htm)

1992:

Crama, Y. and F.C.R. Spieksma, Approximation algorithms for three-dimensional assignment problems with triangle inequalities, European Journal of Operational Research 60, 273-279. (pdf)
(This paper contains computational experiments on instances that can be found here: instancesEJOR.htm)

1990:

Spieksma, F.C.R., K. Vrieze, and A.G. Oerlemans, On the system setup and the scheduling problem in a flexible manufacturing system (FMS), Statistica Neerlandica 44, 125-138. (pdf)

Crama, Y., A.W.J. Kolen, A.G. Oerlemans and F.C.R. Spieksma, Throughput rate optimization in the automated assembly of printed circuit boards, Annals of Operations Research 26, 455-480. (pdf)