Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Frits C. R.
    Last name: Spieksma
    DBLP: 25/6435
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 37  
    Select a publication
    Show Title Venue Rating Date
    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, Volume 4 (0) 2010
    Dries R. Goossens, Frits C. R. Spieksma.
    The transportation problem with exclusionary side constraints.
    4OR 2009, Volume 7 (0) 2009
    Dries R. Goossens, Frits C. R. Spieksma.
    Exact algorithms for the matrix bid auction.
    Computers OR 2009, Volume 36 (0) 2009
    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, Volume 57 (0) 2009
    Maurice Queyranne, Frits C. R. Spieksma.
    Multi-index Transportation Problems.
    Encyclopedia of Optimization, Second Edition 2009 (0) 2009
    Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma.
    Counting and enumerating aggregate classifiers.
    Discrete Applied Mathematics 2008, Volume 156 (0) 2008
    Linda S. Moonen, Frits C. R. Spieksma.
    Partitioning a weighted partial order.
    J. Comb. Optim. 2008, Volume 15 (0) 2008
    Sofie Coene, Frits C. R. Spieksma.
    Profit-based latency problems on the line.
    Oper. Res. Lett. 2008, Volume 36 (0) 2008
    Dries R. Goossens, Frits C. R. Spieksma.
    Exact Algorithms for the Matrix Bid Auction.
    Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings 2007 (0) 2007
    Sofie Coene, Frits C. R. Spieksma.
    A latency problem with profits.
    Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007 2007 (0) 2007
    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, Volume 178 (0) 2007
    Yves Crama, Linda S. Moonen, Frits C. R. Spieksma, Ellen Talloen.
    The tool switching problem revisited.
    European Journal of Operational Research 2007, Volume 182 (0) 2007
    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.
    Dependable Systems: Software, Computing, Networks, Research Results of the DICS Program 2006 (0) 2006
    Linda S. Moonen, Frits C. R. Spieksma.
    Exact Algorithms for a Loading Problem with Bounded Clique Width.
    INFORMS Journal on Computing 2006, Volume 18 (0) 2006
    Sofia Kovaleva, Frits C. R. Spieksma.
    Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems.
    SIAM J. Discrete Math. 2006, Volume 20 (0) 2006
    Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma.
    Modeling and solving the periodic maintenance problem.
    European Journal of Operational Research 2006, Volume 172 (0) 2006
    Frits C. R. Spieksma, Gerhard J. Woeginger.
    The no-wait flow-shop paradox.
    Oper. Res. Lett. 2005, Volume 33 (0) 2005
    Sofia Kovaleva, Frits C. R. Spieksma.
    Approximation of Rectangle Stabbing and Interval Stabbing Problems.
    Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings 2004 (0) 2004
    Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma.
    Approximation of a Retrieval Problem for Parallel Disks.
    Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings 2003 (0) 2003
    Patrick P. A. Storms, Frits C. R. Spieksma.
    An LP-based algorithm for the data association problem in multitarget tracking.
    Computers OR 2003, Volume 30 (0) 2003
    Thomas Erlebach, Frits C. R. Spieksma.
    Interval selection: Applications, algorithms, and lower bounds.
    J. Algorithms 2003, Volume 46 (0) 2003
    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, Volume 52 (0) 2003
    Yves Crama, Joris van de Klundert, Frits C. R. Spieksma.
    Production planning problems in printed circuit board assembly.
    Discrete Applied Mathematics 2002, Volume 123 (0) 2002
    Sofia Kovaleva, Frits C. R. Spieksma.
    Approximation of a Geometric Set Covering Problem.
    Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings 2001 (0) 2001
    S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma.
    A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.
    Math. Oper. Res. 2001, Volume 26 (0) 2001

    Your query returned 37 matches in the database.