Frits C. R. Spieksma

	2011
53		Sofie Coene, Frits C. R. Spieksma: The Lockmaster's problem. ATMOS 2011: 27-37
52		Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem CoRR abs/1112.0534: (2011)
51		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)
50		Dries R. Goossens, Frits C. R. Spieksma: Breaks, cuts, and patterns. Oper. Res. Lett. 39(6): 428-432 (2011)
49		Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger: Charlemagne's Challenge: The Periodic Latency Problem. Operations Research 59(3): 674-683 (2011)
	2010
48		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
47		Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen: Heuristics for the Traveling Repairman Problem with Profits. ATMOS 2010: 34-44
46		Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: The Focus of Attention Problem. SODA 2010: 312-317
45		Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma: Round robin tournaments and three index assignments. 4OR 8(4): 365-374 (2010)
44		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)
43		Sofie Coene, A. Arnout, Frits C. R. Spieksma: On a periodic vehicle routing problem. JORS 61(12): 1719-1728 (2010)
42		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)
41		Frits C. R. Spieksma: Book review. Oper. Res. Lett. 38(3): 240 (2010)
40		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)
	2009
39		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
38		Maurice Queyranne, Frits C. R. Spieksma: Multi-index Transportation Problems. Encyclopedia of Optimization 2009: 2413-2419
37		Dries R. Goossens, Frits C. R. Spieksma: The transportation problem with exclusionary side constraints. 4OR 7(1): 51-60 (2009)
36		Dries R. Goossens, Frits C. R. Spieksma: Exact algorithms for the matrix bid auction. Computers & OR 36(4): 1090-1109 (2009)
35		Dries R. Goossens, Frits C. R. Spieksma: Scheduling the Belgian Soccer League. Interfaces 39(2): 109-118 (2009)
34		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)
	2008
33		Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma: Counting and enumerating aggregate classifiers. Discrete Applied Mathematics 156(13): 2459-2468 (2008)
32		Linda S. Moonen, Frits C. R. Spieksma: Partitioning a weighted partial order. J. Comb. Optim. 15(4): 342-356 (2008)
31		Sofie Coene, Frits C. R. Spieksma: Profit-based latency problems on the line. Oper. Res. Lett. 36(3): 333-337 (2008)
	2007
30		Sofie Coene, Frits C. R. Spieksma: A latency problem with profits. CTW 2007: 29-32
29		Dries R. Goossens, Frits C. R. Spieksma: Exact Algorithms for the Matrix Bid Auction. WEA 2007: 433-445
28		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)
27		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
26		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
25		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)
24		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)
23		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
22		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)
21		Frits C. R. Spieksma, Gerhard J. Woeginger: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005)
	2004
20		Sofia Kovaleva, Frits C. R. Spieksma: Approximation of Rectangle Stabbing and Interval Stabbing Problems. ESA 2004: 426-435
	2003
19		Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma: Approximation of a Retrieval Problem for Parallel Disks. CIAC 2003: 178-188
18		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		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		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		Sofia Kovaleva, Frits C. R. Spieksma: Approximation of a Geometric Set Covering Problem. ISAAC 2001: 493-501
13		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		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		Thomas Erlebach, Frits C. R. Spieksma: Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240
	1999
10		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		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		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		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	[33]
2	Joep Aerts	[17] [19]
3	A. Arnout	[43]
4	Hans-Jürgen Bandelt	[2] [10]
5	Dirk Briskorn	[45]
6	Dirk Cattrysse	[47]
7	Sofie Coene	[30] [31] [43] [47] [49] [53]
8	Yves Crama	[2] [4] [6] [15] [27] [33]
9	Thijs Dewilde	[47]
10	Andreas Drexl	[45]
11	Christoph Dürr	[52]
12	Thomas Erlebach	[11] [16] [26] [34]
13	Willy Gochet	[33]
14	Dries R. Goossens	[28] [29] [35] [36] [37] [39] [40] [44] [46] [50]
15	Alexander Grigoriev	[25]
16	Alexander Hall	[26]
17	Cor A. J. Hurkens	[48]
18	Joris van de Klundert	[15] [22] [25] [28]
19	Jan H. M. Korst	[17] [19]
20	Sofia Kovaleva	[14] [20] [23]
21	Jeroen Kuipers	[22]
22	Roel Leus	[48] [51]
23	A. J. T. Maas	[28]
24	S. Thomas McCormick	[8] [13]
25	Linda S. Moonen	[24] [26] [27] [32] [34]
26	Rudolf Müller	[44]
27	Fabrice Talla Nobibon	[42] [48] [51] [52]
28	Maarten Oosten	[10] [12]
29	Alessandro Panconesi	[26]
30	Sergey Polyakovskiy	[39] [40] [46]
31	Maurice Queyranne	[1] [7] [38] [52]
32	Jeroen H. G. C. Rutten	[10] [12]
33	Scott R. Smallwood	[8] [13]
34	Patrick P. A. Storms	[18]
35	Ellen Talloen	[27]
36	Fabio Tardella	[1]
37	Pieter Vansteenwegen	[47]
38	Wim F. J. Verhaegh	[17]
39	Danica Vukadinovic	[26] [34]
40	Maarten Winkels	[22]
41	Gerhard J. Woeginger	[17] [21] [39] [40] [46] [49] [52]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page