Frits C. R. Spieksma Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

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

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)