Frits C. R. Spieksma

2009
33	EE	Maurice Queyranne, Frits C. R. Spieksma: Multi-index Transportation Problems. Encyclopedia of Optimization 2009: 2413-2419
32	EE	Dries R. Goossens, Frits C. R. Spieksma: Exact algorithms for the matrix bid auction. Computers & OR 36(4): 1090-1109 (2009)
2008
31	EE	Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma: Counting and enumerating aggregate classifiers. Discrete Applied Mathematics 156(13): 2459-2468 (2008)
30	EE	Linda S. Moonen, Frits C. R. Spieksma: Partitioning a weighted partial order. J. Comb. Optim. 15(4): 342-356 (2008)
29	EE	Sofie Coene, Frits C. R. Spieksma: Profit-based latency problems on the line. Oper. Res. Lett. 36(3): 333-337 (2008)
2007
28		Sofie Coene, Frits C. R. Spieksma: A latency problem with profits. CTW 2007: 29-32
27	EE	Dries R. Goossens, Frits C. R. Spieksma: Exact Algorithms for the Matrix Bid Auction. WEA 2007: 433-445
26	EE	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)
25	EE	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)
2006
24	EE	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
23	EE	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)
22	EE	Sofia Kovaleva, Frits C. R. Spieksma: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. SIAM J. Discrete Math. 20(3): 748-768 (2006)
2005
21	EE	Frits C. R. Spieksma, Gerhard J. Woeginger: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005)
2004
20	EE	Sofia Kovaleva, Frits C. R. Spieksma: Approximation of Rectangle Stabbing and Interval Stabbing Problems. ESA 2004: 426-435
2003
19	EE	Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma: Approximation of a Retrieval Problem for Parallel Disks. CIAC 2003: 178-188
18	EE	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)
17	EE	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)
16	EE	Thomas Erlebach, Frits C. R. Spieksma: Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46(1): 27-53 (2003)
2002
15		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)
2001
14	EE	Sofia Kovaleva, Frits C. R. Spieksma: Approximation of a Geometric Set Covering Problem. ISAAC 2001: 493-501
13	EE	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)
12	EE	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)
2000
11	EE	Thomas Erlebach, Frits C. R. Spieksma: Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240
1999
10	EE	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)
1998
9	EE	Frits C. R. Spieksma: Approximating an Interval Scheduling Problem. APPROX 1998: 169-180
1997
8		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
7	EE	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)
1996
6		Yves Crama, Frits C. R. Spieksma: Scheduling jobs of equal length: compleixty, facets and computational results. Math. Program. 72: 207-227 (1996)
1995
5		Frits C. R. Spieksma: Boltzmann Machines. Artificial Neural Networks 1995: 119-129
4		Yves Crama, Frits C. R. Spieksma: Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. IPCO 1995: 277-291
1994
3	EE	Frits C. R. Spieksma: A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & OR 21(1): 19-25 (1994)
2		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)
1993
1		Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella: A general class of greedily solvable linear programs. IPCO 1993: 385-399

Coauthor Index

1	Jan Adem	[31]
2	Joep Aerts	[17] [19]
3	Hans-Jürgen Bandelt	[2] [10]
4	Sofie Coene	[28] [29]
5	Yves Crama	[2] [4] [6] [15] [25] [31]
6	Thomas Erlebach	[11] [16] [24]
7	Willy Gochet	[31]
8	Dries R. Goossens	[26] [27] [32]
9	Alexander Grigoriev	[23]
10	Alexander Hall	[24]
11	Joris van de Klundert	[15] [23] [26]
12	Jan H. M. Korst	[17] [19]
13	Sofia Kovaleva	[14] [20] [22]
14	A. J. T. Maas	[26]
15	S. Thomas McCormick	[8] [13]
16	Linda S. Moonen	[24] [25] [30]
17	Maarten Oosten	[10] [12]
18	Alessandro Panconesi	[24]
19	Maurice Queyranne	[1] [7] [33]
20	Jeroen H. G. C. Rutten	[10] [12]
21	Scott R. Smallwood	[8] [13]
22	Patrick P. A. Storms	[18]
23	Ellen Talloen	[25]
24	Fabio Tardella	[1]
25	Wim F. J. Verhaegh	[17]
26	Danica Vukadinovic	[24]
27	Gerhard J. Woeginger	[17] [21]

Colors in the list of coauthors