| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma |
Computer-assisted proof of performance ratios for the Differencing Method.  |
Discrete Optimization  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Jeroen Beliën, Frits C. R. Spieksma |
Comparing league formats with respect to match importance in Belgian football. |
Annals OR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger |
The interval ordering problem. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma |
Approximating the Multi-level Bottleneck Assignment Problem. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Frits C. R. Spieksma |
Breaks, cuts, and patterns. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger |
Charlemagne's Challenge: The Periodic Latency Problem. |
Operations Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger |
The interval ordering problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sofie Coene, Frits C. R. Spieksma |
The Lockmaster's problem. |
ATMOS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frits C. R. Spieksma |
Book review. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
The approximability of three-dimensional assignment problems with bottleneck objective. |
Optimization Letters |
2010 |
DBLP DOI BibTeX RDF |
Bottleneck problem, Multidimensional assignment, Computational complexity, Approximation, Efficient algorithm |
| 1 | Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma |
Round robin tournaments and three index assignments. |
4OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrice Talla Nobibon, Frits C. R. Spieksma |
On the complexity of testing the Collective Axiom of Revealed Preference. |
Mathematical Social Sciences |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofie Coene, A. Arnout, Frits C. R. Spieksma |
On a periodic vehicle routing problem. |
JORS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma |
Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. |
INFORMS Journal on Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
The Focus of Attention Problem. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma |
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. |
AAIM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen |
Heuristics for the Traveling Repairman Problem with Profits. |
ATMOS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic |
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. |
Operations Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Frits C. R. Spieksma |
Scheduling the Belgian Soccer League. |
Interfaces |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Frits C. R. Spieksma |
The transportation problem with exclusionary side constraints. |
4OR |
2009 |
DBLP DOI BibTeX RDF |
MSC classification (2000) 68Q25 |
| 1 | Dries R. Goossens, Frits C. R. Spieksma |
Exact algorithms for the matrix bid auction. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Frits C. R. Spieksma |
Multi-index Transportation Problems. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Three-dimensional transportation problem, Approximation algorithms, Greedy algorithm, Transportation problem, Monge property |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofie Coene, Frits C. R. Spieksma |
Profit-based latency problems on the line. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Linda S. Moonen, Frits C. R. Spieksma |
Partitioning a weighted partial order. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Chain decomposition, Approximation algorithms, Partially ordered sets |
| 1 | Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma |
Counting and enumerating aggregate classifiers. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Crama, Linda S. Moonen, Frits C. R. Spieksma, Ellen Talloen |
The tool switching problem revisited. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Frits C. R. Spieksma |
Exact Algorithms for the Matrix Bid Auction. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofie Coene, Frits C. R. Spieksma |
A latency problem with profits. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma |
Modeling and solving the periodic maintenance problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofia Kovaleva, Frits C. R. Spieksma |
Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Linda S. Moonen, Frits C. R. Spieksma |
Exact Algorithms for a Loading Problem with Bounded Clique Width. |
INFORMS Journal on Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Frits C. R. Spieksma, Gerhard J. Woeginger |
The no-wait flow-shop paradox. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joris van de Klundert, Jeroen Kuipers, Frits C. R. Spieksma, Maarten Winkels |
Selecting Telecommunication Carriers to Obtain Volume Discounts. |
Interfaces |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofia Kovaleva, Frits C. R. Spieksma |
Approximation of Rectangle Stabbing and Interval Stabbing Problems. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
Random redundant storage, load balancing, complexity analysis, video servers |
| 1 | Thomas Erlebach, Frits C. R. Spieksma |
Interval selection: Applications, algorithms, and lower bounds. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick P. A. Storms, Frits C. R. Spieksma |
An LP-based algorithm for the data association problem in multitarget tracking. |
Computers & OR |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma |
Approximation of a Retrieval Problem for Parallel Disks. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofia Kovaleva, Frits C. R. Spieksma |
Primal-dual approximation algorithms for a packing-covering pair of problems. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Crama, Joris van de Klundert, Frits C. R. Spieksma |
Production planning problems in printed circuit board assembly. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma |
The clique partitioning problem: Facets and patching facets. |
Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma |
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. |
Math. Oper. Res. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofia Kovaleva, Frits C. R. Spieksma |
Approximation of a Geometric Set Covering Problem. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Frits C. R. Spieksma |
Simple Algorithms for a Weighted Interval Selection Problem. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Frits C. R. Spieksma |
Approximating an Interval Scheduling Problem. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Frits C. R. Spieksma |
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma |
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Crama, Frits C. R. Spieksma |
Scheduling jobs of equal length: compleixty, facets and computational results. |
Math. Program. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Frits C. R. Spieksma |
Boltzmann Machines. |
Artificial Neural Networks |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Crama, Frits C. R. Spieksma |
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. |
IPCO |
1995 |
DBLP DOI BibTeX RDF |
polyhedral description, scheduling, computational complexity |
| 1 | Frits C. R. Spieksma |
A branch-and-bound algorithm for the two-dimensional vector packing problem. |
Computers & OR |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma |
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. |
Discrete Applied Mathematics |
1994 |
DBLP BibTeX RDF |
|
| 1 | Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella |
A general class of greedily solvable linear programs. |
IPCO |
1993 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")