|
Search the dblp DataBase
Frits C. R. Spieksma:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Frits C. R. Spieksma
Boltzmann Machines. [Citation Graph (0, 0)][DBLP] Artificial Neural Networks, 1995, pp:119-129 [Conf]
- Frits C. R. Spieksma
Approximating an Interval Scheduling Problem. [Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:169-180 [Conf]
- Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
Approximation of a Retrieval Problem for Parallel Disks. [Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:178-188 [Conf]
- Sofia Kovaleva, Frits C. R. Spieksma
Approximation of Rectangle Stabbing and Interval Stabbing Problems. [Citation Graph (0, 0)][DBLP] ESA, 2004, pp:426-435 [Conf]
- Yves Crama, Frits C. R. Spieksma
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:277-291 [Conf]
- Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella
A general class of greedily solvable linear programs. [Citation Graph (0, 0)][DBLP] IPCO, 1993, pp:385-399 [Conf]
- Thomas Erlebach, Frits C. R. Spieksma
Simple Algorithms for a Weighted Interval Selection Problem. [Citation Graph (0, 0)][DBLP] ISAAC, 2000, pp:228-240 [Conf]
- Sofia Kovaleva, Frits C. R. Spieksma
Approximation of a Geometric Set Covering Problem. [Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:493-501 [Conf]
- S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:509-517 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] Research Results of the DICS Program, 2006, pp:260-274 [Conf]
- Frits C. R. Spieksma
A branch-and-bound algorithm for the two-dimensional vector packing problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 1994, v:21, n:1, pp:19-25 [Journal]
- Patrick P. A. Storms, Frits C. R. Spieksma
An LP-based algorithm for the data association problem in multitarget tracking. [Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:7, pp:1067-1085 [Journal]
- Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:25-50 [Journal]
- Yves Crama, Joris van de Klundert, Frits C. R. Spieksma
Production planning problems in printed circuit board assembly. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:339-361 [Journal]
- Maurice Queyranne, Frits C. R. Spieksma
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:239-253 [Journal]
- Thomas Erlebach, Frits C. R. Spieksma
Interval selection: Applications, algorithms, and lower bounds. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:46, n:1, pp:27-53 [Journal]
- S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. [Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2001, v:26, n:1, pp:31-49 [Journal]
- Yves Crama, Frits C. R. Spieksma
Scheduling jobs of equal length: compleixty, facets and computational results. [Citation Graph (0, 0)][DBLP] Math. Program., 1996, v:72, n:, pp:207-227 [Journal]
- Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma
The clique partitioning problem: Facets and patching facets. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:38, n:4, pp:209-226 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:24, n:5, pp:235-243 [Journal]
- Frits C. R. Spieksma, Gerhard J. Woeginger
The no-wait flow-shop paradox. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:6, pp:603-608 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 2003, v:52, n:9, pp:1210-1214 [Journal]
- Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma
Modeling and solving the periodic maintenance problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:172, n:3, pp:783-797 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:603-626 [Journal]
- Dries R. Goossens, Frits C. R. Spieksma
Exact Algorithms for the Matrix Bid Auction. [Citation Graph (0, 0)][DBLP] WEA, 2007, pp:433-445 [Conf]
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. [Citation Graph (, )][DBLP]
The Focus of Attention Problem. [Citation Graph (, )][DBLP]
Between a Rock and a Hard Place: The Two-to-One Assignment Problem. [Citation Graph (, )][DBLP]
A latency problem with profits. [Citation Graph (, )][DBLP]
The transportation problem with exclusionary side constraints. [Citation Graph (, )][DBLP]
Exact algorithms for the matrix bid auction. [Citation Graph (, )][DBLP]
Counting and enumerating aggregate classifiers. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|