![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Frits C. R. Spieksma
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j100]Danny Blom
, Bart Smeulders, Frits C. R. Spieksma
:
Rejection-proof mechanisms for multi-agent kidney exchange. Games Econ. Behav. 143: 25-50 (2024) - [j99]Bart Smeulders
, Danny Blom, Frits C. R. Spieksma
:
Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete. Math. Program. 203(1): 347-368 (2024) - [j98]Mark de Berg
, Arpan Sadhukhan
, Frits C. R. Spieksma
:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. 38(1): 790-827 (2024) - [c34]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. WALCOM 2024: 273-287 - 2023
- [j97]Jasper van Doornmalen
, Christopher Hojny
, Roel Lambers
, Frits C. R. Spieksma
:
Integer programming models for round robin tournaments. Eur. J. Oper. Res. 310(1): 24-33 (2023) - [j96]Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma
, Mehmet Akif Yildiz
:
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51(5): 528-532 (2023) - [j95]Roel Lambers
, Dries R. Goossens, Frits C. R. Spieksma
:
The flexibility of home away pattern sets. J. Sched. 26(5): 413-423 (2023) - [c33]Mark de Berg, Arpan Sadhukhan
, Frits C. R. Spieksma:
Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM 2023: 27:1-27:19 - [c32]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. ISAAC 2023: 24:1-24:17 - [i9]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. CoRR abs/2303.07290 (2023) - 2022
- [j94]Kelin Luo
, Frits C. R. Spieksma
:
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. Algorithms 15(2): 30 (2022) - [j93]Pierre-Antoine Morin, Christian Artigues, Alain Haït
, Tamás Kis, Frits C. R. Spieksma
:
A project scheduling problem with periodically aggregated resource-constraints. Comput. Oper. Res. 141: 105688 (2022) - [j92]Frits C. R. Spieksma:
Obituary for Gerhard Woeginger. Bull. EATCS 137 (2022) - [j91]Bart Vangerven, Dirk Briskorn
, Dries R. Goossens, Frits C. R. Spieksma
:
Parliament seating assignment problems. Eur. J. Oper. Res. 296(3): 914-926 (2022) - [j90]Bart Smeulders
, Valentin Bartier, Yves Crama
, Frits C. R. Spieksma
:
Recourse in Kidney Exchange Programs. INFORMS J. Comput. 34(2): 1191-1206 (2022) - [j89]Danny Blom
, Rudi Pendavingh, Frits C. R. Spieksma
:
Filling a Theater During the COVID-19 Pandemic. INFORMS J. Appl. Anal. 52(6): 473-484 (2022) - [j88]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma
, Marc Uetz:
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50(3): iii (2022) - [j87]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma
, Marc Uetz
:
In memoriam Gerhard Woeginger. J. Sched. 25(5): 503-505 (2022) - [c31]Thomas Erlebach, Kelin Luo
, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. ISAAC 2022: 49:1-49:16 - [c30]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT 2022: 15:1-15:21 - [i8]Danny Blom, Bart Smeulders, Frits C. R. Spieksma:
Rejection-proof Kidney Exchange Mechanisms. CoRR abs/2206.11525 (2022) - [i7]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. CoRR abs/2209.12314 (2022) - 2021
- [j86]Annette M. C. Ficker, Frits C. R. Spieksma
, Gerhard J. Woeginger:
The transportation problem with conflicts. Ann. Oper. Res. 298(1): 207-227 (2021) - [j85]Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma
:
Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions. Bus. Inf. Syst. Eng. 63(2): 113-127 (2021) - [j84]Tim Ophelders, Roel Lambers
, Frits C. R. Spieksma
, Tjark Vredeveld
:
A note on equitable Hamiltonian cycles. Discret. Appl. Math. 303: 127-136 (2021) - [j83]Péter Biró, Joris van de Klundert
, David F. Manlove, William Pettersson
, Tommy Andersson, Lisa Burnapp, Pavel Chromy, Pablo Delgado, Piotr Dworczak, Bernadette Haase, Aline Hemke, Rachel Johnson
, Xenia Klimentova
, Dirk Kuypers, Alessandro Nanni Costa, Bart Smeulders, Frits C. R. Spieksma
, María O. Valentín, Ana Viana
:
Modelling and optimisation in European Kidney Exchange Programmes. Eur. J. Oper. Res. 291(2): 447-456 (2021) - [j82]Lotte Berghman
, Frits C. R. Spieksma
, Vincent T'kindt:
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. RAIRO Oper. Res. 55(Supplement): S1747-S1765 (2021) - [c29]Kelin Luo
, Frits C. R. Spieksma
:
Online Bin Packing with Overload Cost. CALDAM 2021: 3-15 - [c28]Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma:
The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. CPAIOR 2021: 149-162 - [i6]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR abs/2112.05426 (2021) - 2020
- [j81]Morteza Davari
, Dries R. Goossens, Jeroen Beliën
, Roel Lambers
, Frits C. R. Spieksma
:
The multi-league sports scheduling problem, or how to schedule thousands of matches. Oper. Res. Lett. 48(2): 180-187 (2020) - [c27]Kelin Luo
, Frits C. R. Spieksma
:
Approximation Algorithms for Car-Sharing Problems. COCOON 2020: 262-273 - [i5]Kelin Luo, Frits C. R. Spieksma:
Approximation algorithms for car-sharing problems. CoRR abs/2007.03057 (2020) - [i4]Bart Smeulders, Danny Blom, Frits C. R. Spieksma:
The Stackelberg Kidney Exchange Problem is Σ2p-complete. CoRR abs/2007.03323 (2020) - [i3]Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma:
Filling a theatre in times of corona. CoRR abs/2010.01981 (2020)
2010 – 2019
- 2019
- [j80]Túlio A. M. Toffolo
, Jan Christiaens, Frits C. R. Spieksma
, Greet Vanden Berghe:
The sport teams grouping problem. Ann. Oper. Res. 275(1): 223-243 (2019) - [j79]David Van Bulck
, Dries R. Goossens
, Frits C. R. Spieksma
:
Scheduling a non-professional indoor football league: a tabu search based approach. Ann. Oper. Res. 275(2): 715-730 (2019) - [j78]Bart Smeulders, Yves Crama
, Frits C. R. Spieksma
:
Revealed preference theory: An algorithmic outlook. Eur. J. Oper. Res. 272(3): 803-815 (2019) - [j77]Ward Passchyn
, Dirk Briskorn
, Frits C. R. Spieksma
:
No-Wait Scheduling for Locks. INFORMS J. Comput. 31(3): 413-428 (2019) - [j76]Nicolas Pinson, Frits C. R. Spieksma
:
Online interval scheduling on two related machines: the power of lookahead. J. Comb. Optim. 38(1): 224-253 (2019) - [j75]Ward Passchyn
, Frits C. R. Spieksma
:
Scheduling parallel batching machines in a sequence. J. Sched. 22(3): 335-357 (2019) - 2018
- [j74]Bart Smeulders
, Clintin P. Davis-Stober, Michel Regenwetter
, Frits C. R. Spieksma
:
Testing probabilistic models of choice using column generation. Comput. Oper. Res. 95: 32-43 (2018) - [j73]Annette M. C. Ficker, Frits C. R. Spieksma
, Gerhard J. Woeginger:
Robust balanced optimization. EURO J. Comput. Optim. 6(3): 239-266 (2018) - [j72]Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
:
Round-robin tournaments generated by the Circle Method have maximum carry-over. Math. Program. 172(1-2): 277-302 (2018) - [c26]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC 2018: 45:1-45:12 - [i2]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR abs/1807.01962 (2018) - 2017
- [j71]Bart Vangerven
, Dries R. Goossens, Frits C. R. Spieksma
:
Winner determination in geometrical combinatorial auctions. Eur. J. Oper. Res. 258(1): 254-263 (2017) - [j70]Joris Kinable
, Bart Smeulders
, Eline Delcour, Frits C. R. Spieksma
:
Exact algorithms for the Equitable Traveling Salesman Problem. Eur. J. Oper. Res. 261(2): 475-485 (2017) - [j69]Trivikram Dokka
, Ioannis Mourtos
, Frits C. R. Spieksma
:
Fast separation for the three-index assignment problem. Math. Program. Comput. 9(1): 39-59 (2017) - [j68]Yves Crama, Dries R. Goossens, Roel Leus
, Michaël Schyns, Frits C. R. Spieksma
:
Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015). J. Sched. 20(6): 543 (2017) - 2016
- [j67]Dries R. Goossens, Sergey Polyakovskiy
, Frits C. R. Spieksma
, Gerhard J. Woeginger:
The Focus of Attention Problem. Algorithmica 74(2): 559-573 (2016) - [j66]Trivikram Dokka
, Frits C. R. Spieksma
:
Facets of the axial three-index assignment polytope. Discret. Appl. Math. 201: 86-104 (2016) - [j65]Ward Passchyn, Dirk Briskorn
, Frits C. R. Spieksma
:
Mathematical programming models for lock scheduling with an emission objective. Eur. J. Oper. Res. 248(3): 802-814 (2016) - [j64]Ward Passchyn, Sofie Coene, Dirk Briskorn
, Johann L. Hurink
, Frits C. R. Spieksma
, Greet Vanden Berghe:
The lockmaster's problem. Eur. J. Oper. Res. 251(2): 432-441 (2016) - [j63]Fabrice Talla Nobibon, Laurens Cherchye
, Yves Crama, Thomas Demuynck
, Bram De Rock
, Frits C. R. Spieksma
:
Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms. Oper. Res. 64(6): 1197-1216 (2016) - [c25]Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
:
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. IPCO 2016: 178-189 - [c24]Annette M. C. Ficker, Frits C. R. Spieksma
, Gerhard J. Woeginger:
Balanced Optimization with Vector Costs. WAOA 2016: 92-102 - 2015
- [j62]Fabrice Talla Nobibon, Bart Smeulders
, Frits C. R. Spieksma
:
A Note on Testing Axioms of Revealed Preference. J. Optim. Theory Appl. 166(3): 1063-1070 (2015) - [j61]Lotte Berghman
, Frits C. R. Spieksma
:
Valid inequalities for a time-indexed formulation. Oper. Res. Lett. 43(3): 268-272 (2015) - 2014
- [j60]Lotte Berghman
, Roel Leus
, Frits C. R. Spieksma
:
Optimal solutions for a dock assignment problem with trailer transportation. Ann. Oper. Res. 213(1): 3-25 (2014) - [j59]Trivikram Dokka
, Yves Crama
, Frits C. R. Spieksma
:
Multi-dimensional vector assignment problems. Discret. Optim. 14: 111-125 (2014) - [j58]Jannes Verstichel, Patrick De Causmaecker
, Frits C. R. Spieksma
, Greet Vanden Berghe:
Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. 235(2): 387-398 (2014) - [j57]Wim Vancroonenburg, Federico Della Croce
, Dries R. Goossens, Frits C. R. Spieksma
:
The Red-Blue transportation problem. Eur. J. Oper. Res. 237(3): 814-823 (2014) - [j56]Dries R. Goossens, Sander Onderstal, Jan Pijnacker, Frits C. R. Spieksma:
Solids: A Combinatorial Auction for Real Estate. Interfaces 44(4): 351-363 (2014) - [j55]Joris Kinable
, Frits C. R. Spieksma, Greet Vanden Berghe:
School bus routing - a column generation approach. Int. Trans. Oper. Res. 21(3): 453-478 (2014) - [j54]Bart Smeulders
, Frits C. R. Spieksma
, Laurens Cherchye, Bram De Rock:
Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms. ACM Trans. Economics and Comput. 2(1): 3:1-3:16 (2014) - [c23]Ward Passchyn, Dirk Briskorn
, Frits C. R. Spieksma
:
Mathematical programming models for scheduling locks in sequence. ATMOS 2014: 92-106 - 2013
- [j53]Thijs Dewilde, Dirk Cattrysse
, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
:
Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. 40(7): 1700-1707 (2013) - [j52]Pablo A. Maya Duque
, Sofie Coene, Peter Goos
, Kenneth Sörensen
, Frits C. R. Spieksma
:
The accessibility arc upgrading problem. Eur. J. Oper. Res. 224(3): 458-465 (2013) - [j51]Patrick Schittekat, Joris Kinable
, Kenneth Sörensen
, Marc Sevaux
, Frits C. R. Spieksma
, Johan Springael
:
A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2): 518-528 (2013) - [j50]Sergey Polyakovskiy
, Frits C. R. Spieksma
, Gerhard J. Woeginger:
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26(1): 1-9 (2013) - [j49]Sofie Coene, Carlo Filippi
, Frits C. R. Spieksma
, Elisa Stevanato:
Balancing profits and costs on trees. Networks 61(3): 200-211 (2013) - 2012
- [j48]Dries R. Goossens, Jeroen Beliën
, Frits C. R. Spieksma
:
Comparing league formats with respect to match importance in Belgian football. Ann. Oper. Res. 194(1): 223-240 (2012) - [j47]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma
, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. Discret. Appl. Math. 160(7-8): 1094-1103 (2012) - [j46]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. Discret. Optim. 9(1): 1-16 (2012) - [j45]Sofie Coene, Frits C. R. Spieksma
, Atri Dutta
, Panagiotis Tsiotras:
On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies. INFOR Inf. Syst. Oper. Res. 50(2): 88-94 (2012) - [j44]Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus
, Frits C. R. Spieksma
:
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. 24(3): 485-499 (2012) - [j43]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. Math. Methods Oper. Res. 76(2): 223-237 (2012) - [j42]Trivikram Dokka
, Anastasia Kouvela, Frits C. R. Spieksma
:
Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40(4): 282-286 (2012) - [j41]Dries R. Goossens, Frits C. R. Spieksma
:
Soccer schedules in Europe: an overview. J. Sched. 15(5): 641-651 (2012) - [c22]Trivikram Dokka, Ioannis Mourtos
, Frits C. R. Spieksma
:
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO 2012: 189-200 - [c21]Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
:
Approximating the Multi-level Bottleneck Assignment Problem. WALCOM 2012: 64-75 - [c20]Trivikram Dokka
, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
:
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA 2012: 286-297 - 2011
- [j40]Fabrice Talla Nobibon, Roel Leus
, Frits C. R. Spieksma
:
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms. Eur. J. Oper. Res. 210(3): 670-683 (2011) - [j39]Sofie Coene, Frits C. R. Spieksma
, Gerhard J. Woeginger:
Charlemagne's Challenge: The Periodic Latency Problem. Oper. Res. 59(3): 674-683 (2011) - [j38]Dries R. Goossens, Frits C. R. Spieksma
:
Breaks, cuts, and patterns. Oper. Res. Lett. 39(6): 428-432 (2011) - [c19]Dries R. Goossens, Sander Onderstal, Frits C. R. Spieksma
:
Solids - A Combinatorial Auction for a Housing Corporation. AMMA 2011: 76-87 - [c18]Sofie Coene, Frits C. R. Spieksma:
The Lockmaster's problem. ATMOS 2011: 27-37 - [c17]Dries R. Goossens, Frits C. R. Spieksma
:
Sports scheduling with generalized breaks. CISched 2011: 54-57 - [i1]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. CoRR abs/1112.0534 (2011) - 2010
- [j37]Dirk Briskorn
, Andreas Drexl, Frits C. R. Spieksma
:
Round robin tournaments and three index assignments. 4OR 8(4): 365-374 (2010) - [j36]Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma
:
Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. INFORMS J. Comput. 22(3): 339-352 (2010) - [j35]Sofie Coene, A. Arnout, Frits C. R. Spieksma
:
On a periodic vehicle routing problem. J. Oper. Res. Soc. 61(12): 1719-1728 (2010) - [j34]Fabrice Talla Nobibon, Frits C. R. Spieksma
:
On the complexity of testing the Collective Axiom of Revealed Preference. Math. Soc. Sci. 60(2): 123-136 (2010) - [j33]Dries R. Goossens, Sergey Polyakovskiy
, Frits C. R. Spieksma
, Gerhard J. Woeginger:
The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. 4(1): 7-16 (2010) - [j32]Frits C. R. Spieksma
:
Book review. Oper. Res. Lett. 38(3): 240 (2010) - [c16]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 - [c15]Thijs Dewilde, Dirk Cattrysse
, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
:
Heuristics for the Traveling Repairman Problem with Profits. ATMOS 2010: 34-44 - [c14]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. SODA 2010: 312-317
2000 – 2009
- 2009
- [j31]Dries R. Goossens, Frits C. R. Spieksma
:
The transportation problem with exclusionary side constraints. 4OR 7(1): 51-60 (2009) - [j30]Dries R. Goossens, Frits C. R. Spieksma
:
Exact algorithms for the matrix bid auction. Comput. Oper. Res. 36(4): 1090-1109 (2009) - [j29]Dries R. Goossens, Frits C. R. Spieksma
:
Scheduling the Belgian Soccer League. Interfaces 39(2): 109-118 (2009) - [j28]Thomas Erlebach
, Linda S. Moonen, Frits C. R. Spieksma
, Danica Vukadinovic
:
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res. 57(4): 1006-1025 (2009) - [c13]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 - [r2]Maurice Queyranne, Frits C. R. Spieksma
:
Multi-index Transportation Problems. Encyclopedia of Optimization 2009: 2413-2419 - 2008
- [j27]Jan Adem, Yves Crama
, Willy Gochet, Frits C. R. Spieksma
:
Counting and enumerating aggregate classifiers. Discret. Appl. Math. 156(13): 2459-2468 (2008) - [j26]Linda S. Moonen, Frits C. R. Spieksma
:
Partitioning a weighted partial order. J. Comb. Optim. 15(4): 342-356 (2008) - [j25]Sofie Coene, Frits C. R. Spieksma
:
Profit-based latency problems on the line. Oper. Res. Lett. 36(3): 333-337 (2008) - [j24]Sofie Coene, Nguyen Van Hop, Joris van de Klundert
, Frits C. R. Spieksma
:
A note on a motion control problem for a placement machine. OR Spectr. 30(3): 535-549 (2008) - 2007
- [j23]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. Eur. J. Oper. Res. 178(2): 603-626 (2007) - [j22]Yves Crama
, Linda S. Moonen, Frits C. R. Spieksma
, Ellen Talloen:
The tool switching problem revisited. Eur. J. Oper. Res. 182(2): 952-957 (2007) - [c12]Sofie Coene, Frits C. R. Spieksma:
A latency problem with profits. CTW 2007: 29-32 - [c11]Dries R. Goossens, Frits C. R. Spieksma
:
Exact Algorithms for the Matrix Bid Auction. WEA 2007: 433-445 - [r1]Frits C. R. Spieksma, Sofia Kovaleva:
A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j21]Alexander Grigoriev
, Joris van de Klundert
, Frits C. R. Spieksma
:
Modeling and solving the periodic maintenance problem. Eur. J. Oper. Res. 172(3): 783-797 (2006) - [j20]Linda S. Moonen, Frits C. R. Spieksma
:
Exact Algorithms for a Loading Problem with Bounded Clique Width. INFORMS J. Comput. 18(4): 455-465 (2006) - [j19]Sofia Kovaleva, Frits C. R. Spieksma
:
Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. SIAM J. Discret. Math. 20(3): 748-768 (2006) - [c10]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 - 2005
- [j18]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) - [j17]Frits C. R. Spieksma
, Gerhard J. Woeginger:
The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005) - 2004
- [j16]Hans-Jürgen Bandelt, A. J. T. Maas, Frits C. R. Spieksma
:
Local search heuristics for multi-index assignment problems with decomposable costs. J. Oper. Res. Soc. 55(7): 694-704 (2004) - [c9]Sofia Kovaleva, Frits C. R. Spieksma
:
Approximation of Rectangle Stabbing and Interval Stabbing Problems. ESA 2004: 426-435 - 2003
- [j15]Patrick P. A. Storms, Frits C. R. Spieksma:
An LP-based algorithm for the data association problem in multitarget tracking. Comput. Oper. Res. 30(7): 1067-1085 (2003) - [j14]Thomas Erlebach
, Frits C. R. Spieksma
:
Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46(1): 27-53 (2003) - [j13]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) - [c8]Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
:
Approximation of a Retrieval Problem for Parallel Disks. CIAC 2003: 178-188 - 2002
- [j12]Yves Crama
, Joris van de Klundert
, Frits C. R. Spieksma:
Production planning problems in printed circuit board assembly. Discret. Appl. Math. 123(1-3): 339-361 (2002) - [j11]Sofia Kovaleva, Frits C. R. Spieksma
:
Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO Oper. Res. 36(1): 53-71 (2002) - 2001
- [j10]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) - [j9]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) - [c7]Sofia Kovaleva, Frits C. R. Spieksma
:
Approximation of a Geometric Set Covering Problem. ISAAC 2001: 493-501 - 2000
- [j8]Antoon W. J. Kolen, Frits C. R. Spieksma:
Solving a bi-criterion cutting stock problem with open-ended demand: a case study. J. Oper. Res. Soc. 51(11): 1238-1247 (2000) - [c6]Thomas Erlebach, Frits C. R. Spieksma
:
Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240
1990 – 1999
- 1999
- [j7]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
- [j6]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A General Class of Greedily Solvable Linear Programs. Math. Oper. Res. 23(4): 892-908 (1998) - [c5]Frits C. R. Spieksma
:
Approximating an Interval Scheduling Problem. APPROX 1998: 169-180 - 1997
- [j5]Maurice Queyranne, Frits C. R. Spieksma
:
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. Discret. Appl. Math. 76(1-3): 239-253 (1997) - [c4]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 - 1996
- [j4]Yves Crama, Frits C. R. Spieksma
:
Scheduling jobs of equal length: compleixty, facets and computational results. Math. Program. 72: 207-227 (1996) - 1995
- [j3]Frits C. R. Spieksma
, Gerhard J. Woeginger, Zhongliang Yu:
Scheduling with safety distances. Ann. Oper. Res. 57(1): 251-264 (1995) - [c3]Frits C. R. Spieksma
:
Boltzmann Machines. Artificial Neural Networks 1995: 119-129 - [c2]Yves Crama, Frits C. R. Spieksma:
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. IPCO 1995: 277-291 - 1994
- [j2]Frits C. R. Spieksma
:
A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput. Oper. Res. 21(1): 19-25 (1994) - [j1]Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma:
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. Discret. Appl. Math. 49(1-3): 25-50 (1994) - 1993
- [c1]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A general class of greedily solvable linear programs. IPCO 1993: 385-399
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint