Frits C. R. Spieksma

According to our database, Frits C. R. Spieksma authored at least 130 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.

Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma

SIAM J. Discret. Math., March, 2024

Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete.

Bart Smeulders, Danny Blom, Frits C. R. Spieksma

Math. Program., January, 2024

Rejection-proof mechanisms for multi-agent kidney exchange.

Danny Blom, Bart Smeulders, Frits C. R. Spieksma

Games Econ. Behav., January, 2024

Stable and Dynamic Minimum Cuts.

Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

The flexibility of home away pattern sets.

Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma

J. Sched., October, 2023

Orthogonal schedules in single round robin tournaments.

Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz

Oper. Res. Lett., September, 2023

Integer programming models for round robin tournaments.

Jasper van Doornmalen, Christopher Hojny, Roel Lambers, Frits C. R. Spieksma

Eur. J. Oper. Res., 2023

Finding Diverse Minimum s-t Cuts.

Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Stable Approximation Algorithms for Dominating Set and Independent Set.

Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma

Proceedings of the Approximation, 2023

2022

In memoriam Gerhard Woeginger.

Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz

Oper. Res. Lett., 2022

Filling a Theater During the COVID-19 Pandemic.

Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma

INFORMS J. Appl. Anal., 2022

Recourse in Kidney Exchange Programs.

Bart Smeulders, Valentin Bartier, Yves Crama, Frits C. R. Spieksma

INFORMS J. Comput., 2022

Parliament seating assignment problems.

Bart Vangerven, Dirk Briskorn, Dries R. Goossens, Frits C. R. Spieksma

Eur. J. Oper. Res., 2022

Obituary for Gerhard Woeginger.

Frits C. R. Spieksma

Bull. EATCS, 2022

Rejection-proof Kidney Exchange Mechanisms.

Danny Blom, Bart Smeulders, Frits C. R. Spieksma

CoRR, 2022

A project scheduling problem with periodically aggregated resource-constraints.

Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma

Comput. Oper. Res., 2022

Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems.

Kelin Luo, Frits C. R. Spieksma

Algorithms, 2022

Package Delivery Using Drones with Restricted Movement Areas.

Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes.

Lotte Berghman, Frits C. R. Spieksma, Vincent T'kindt

RAIRO Oper. Res., 2021

Modelling and optimisation in European Kidney Exchange Programmes.

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

Eur. J. Oper. Res., 2021

A note on equitable Hamiltonian cycles.

Tim Ophelders, Roel Lambers, Frits C. R. Spieksma, Tjark Vredeveld

Discret. Appl. Math., 2021

Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions.

Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma

Bus. Inf. Syst. Eng., 2021

The transportation problem with conflicts.

Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger

Ann. Oper. Res., 2021

The Traveling Social Golfer Problem: The Case of the Volleyball Nations League.

Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Online Bin Packing with Overload Cost.

Kelin Luo, Frits C. R. Spieksma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

The multi-league sports scheduling problem, or how to schedule thousands of matches.

Morteza Davari, Dries R. Goossens, Jeroen Beliën, Roel Lambers, Frits C. R. Spieksma

Oper. Res. Lett., 2020

Filling a theatre in times of corona.

Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma

CoRR, 2020

The Stackelberg Kidney Exchange Problem is Σ₂^p-complete.

Bart Smeulders, Danny Blom, Frits C. R. Spieksma

CoRR, 2020

Approximation Algorithms for Car-Sharing Problems.

Kelin Luo, Frits C. R. Spieksma

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Scheduling parallel batching machines in a sequence.

Ward Passchyn, Frits C. R. Spieksma

J. Sched., 2019

Online interval scheduling on two related machines: the power of lookahead.

Nicolas Pinson, Frits C. R. Spieksma

J. Comb. Optim., 2019

No-Wait Scheduling for Locks.

Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma

INFORMS J. Comput., 2019

Revealed preference theory: An algorithmic outlook.

Bart Smeulders, Yves Crama, Frits C. R. Spieksma

Eur. J. Oper. Res., 2019

The sport teams grouping problem.

Túlio A. M. Toffolo, Jan Christiaens, Frits C. R. Spieksma, Greet Vanden Berghe

Ann. Oper. Res., 2019

Scheduling a non-professional indoor football league: a tabu search based approach.

David Van Bulck, Dries R. Goossens, Frits C. R. Spieksma

Ann. Oper. Res., 2019

2018

Round-robin tournaments generated by the Circle Method have maximum carry-over.

Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma

Math. Program., 2018

Robust balanced optimization.

Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger

EURO J. Comput. Optim., 2018

Testing probabilistic models of choice using column generation.

Bart Smeulders, Clintin P. Davis-Stober, Michel Regenwetter, Frits C. R. Spieksma

Comput. Oper. Res., 2018

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.

Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015).

Yves Crama, Dries R. Goossens, Roel Leus, Michaël Schyns, Frits C. R. Spieksma

J. Sched., 2017

Fast separation for the three-index assignment problem.

Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma

Math. Program. Comput., 2017

Winner determination in geometrical combinatorial auctions.

Bart Vangerven, Dries R. Goossens, Frits C. R. Spieksma

Eur. J. Oper. Res., 2017

Exact algorithms for the Equitable Traveling Salesman Problem.

Joris Kinable, Bart Smeulders, Eline Delcour, Frits C. R. Spieksma

Eur. J. Oper. Res., 2017

2016

Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms.

Fabrice Talla Nobibon, Laurens Cherchye, Yves Crama, Thomas Demuynck, Bram De Rock, Frits C. R. Spieksma

Oper. Res., 2016

The lockmaster's problem.

Ward Passchyn, Sofie Coene, Dirk Briskorn, Johann L. Hurink, Frits C. R. Spieksma, Greet Vanden Berghe

Eur. J. Oper. Res., 2016

Mathematical programming models for lock scheduling with an emission objective.

Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma

Eur. J. Oper. Res., 2016

Facets of the axial three-index assignment polytope.

Trivikram Dokka, Frits C. R. Spieksma

Discret. Appl. Math., 2016

The Focus of Attention Problem.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Algorithmica, 2016

Balanced Optimization with Vector Costs.

Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

Valid inequalities for a time-indexed formulation.

Lotte Berghman, Frits C. R. Spieksma

Oper. Res. Lett., 2015

A Note on Testing Axioms of Revealed Preference.

Fabrice Talla Nobibon, Bart Smeulders, Frits C. R. Spieksma

J. Optim. Theory Appl., 2015

2014

Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms.

Bart Smeulders, Frits C. R. Spieksma, Laurens Cherchye, Bram De Rock

ACM Trans. Economics and Comput., 2014

School bus routing - a column generation approach.

Joris Kinable, Frits C. R. Spieksma, Greet Vanden Berghe

Int. Trans. Oper. Res., 2014

Solids: A Combinatorial Auction for Real Estate.

Dries R. Goossens, Sander Onderstal, Jan Pijnacker, Frits C. R. Spieksma

Interfaces, 2014

Exact and heuristic methods for placing ships in locks.

Jannes Verstichel, Patrick De Causmaecker, Frits C. R. Spieksma, Greet Vanden Berghe

Eur. J. Oper. Res., 2014

The Red-Blue transportation problem.

Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma

Eur. J. Oper. Res., 2014

Multi-dimensional vector assignment problems.

Trivikram Dokka, Yves Crama, Frits C. R. Spieksma

Discret. Optim., 2014

Optimal solutions for a dock assignment problem with trailer transportation.

Lotte Berghman, Roel Leus, Frits C. R. Spieksma

Ann. Oper. Res., 2014

Mathematical programming models for scheduling locks in sequence.

Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013

Balancing profits and costs on trees.

Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato

Networks, 2013

The three-dimensional matching problem in Kalmanson matrices.

Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

J. Comb. Optim., 2013

A metaheuristic for the school bus routing problem with bus stop selection.

Patrick Schittekat, Joris Kinable, Kenneth Sörensen, Marc Sevaux, Frits C. R. Spieksma, Johan Springael

Eur. J. Oper. Res., 2013

The accessibility arc upgrading problem.

Pablo A. Maya Duque, Sofie Coene, Peter Goos, Kenneth Sörensen, Frits C. R. Spieksma

Eur. J. Oper. Res., 2013

Heuristics for the traveling repairman problem with profits.

Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen

Comput. Oper. Res., 2013

2012

Soccer schedules in Europe: an overview.

Dries R. Goossens, Frits C. R. Spieksma

J. Sched., 2012

Approximating the multi-level bottleneck assignment problem.

Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma

Oper. Res. Lett., 2012

Between a rock and a hard place: the two-to-one assignment problem.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Math. Methods Oper. Res., 2012

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles.

Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma

INFORMS J. Comput., 2012

On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies.

Sofie Coene, Frits C. R. Spieksma, Atri Dutta, Panagiotis Tsiotras

INFOR Inf. Syst. Oper. Res., 2012

Computer-assisted proof of performance ratios for the Differencing Method.

Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma

Discret. Optim., 2012

The interval ordering problem.

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger

Discret. Appl. Math., 2012

Comparing league formats with respect to match importance in Belgian football.

Dries R. Goossens, Jeroen Beliën, Frits C. R. Spieksma

Ann. Oper. Res., 2012

Approximation Algorithms for the Wafer to Wafer Integration Problem.

Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Fast Separation Algorithms for Three-Index Assignment Problems.

Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Breaks, cuts, and patterns.

Dries R. Goossens, Frits C. R. Spieksma

Oper. Res. Lett., 2011

Charlemagne's Challenge: The Periodic Latency Problem.

Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger

Oper. Res., 2011

Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms.

Fabrice Talla Nobibon, Roel Leus, Frits C. R. Spieksma

Eur. J. Oper. Res., 2011

Sports scheduling with generalized breaks.

Dries R. Goossens, Frits C. R. Spieksma

Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Scheduling, 2011

The Lockmaster's problem.

Sofie Coene, Frits C. R. Spieksma

Proceedings of the ATMOS 2011, 2011

Solids - A Combinatorial Auction for a Housing Corporation.

Dries R. Goossens, Sander Onderstal, Frits C. R. Spieksma

Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

2010

Book review.

Frits C. R. Spieksma

Oper. Res. Lett., 2010

The approximability of three-dimensional assignment problems with bottleneck objective.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Optim. Lett., 2010

On the complexity of testing the Collective Axiom of Revealed Preference.

Fabrice Talla Nobibon, Frits C. R. Spieksma

Math. Soc. Sci., 2010

On a periodic vehicle routing problem.

Sofie Coene, A. Arnout, Frits C. R. Spieksma

J. Oper. Res. Soc., 2010

Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions.

Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma

INFORMS J. Comput., 2010

Round robin tournaments and three index assignments.

Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma

4OR, 2010

Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles.

Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Multi-index Transportation Problems.

Maurice Queyranne, Frits C. R. Spieksma

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Connectivity Measures for Internet Topologies on the Level of Autonomous Systems.

Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic

Oper. Res., 2009

Scheduling the Belgian Soccer League.

Dries R. Goossens, Frits C. R. Spieksma

Interfaces, 2009

Exact algorithms for the matrix bid auction.

Dries R. Goossens, Frits C. R. Spieksma

Comput. Oper. Res., 2009

The transportation problem with exclusionary side constraints.

Dries R. Goossens, Frits C. R. Spieksma

4OR, 2009

2008

A note on a motion control problem for a placement machine.

Sofie Coene, Nguyen Van Hop, Joris van de Klundert, Frits C. R. Spieksma

OR Spectr., 2008

Profit-based latency problems on the line.

Sofie Coene, Frits C. R. Spieksma

Oper. Res. Lett., 2008

Partitioning a weighted partial order.

Linda S. Moonen, Frits C. R. Spieksma

J. Comb. Optim., 2008

Counting and enumerating aggregate classifiers.

Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Spieksma

Discret. Appl. Math., 2008

2007

A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem.

Frits C. R. Spieksma, Sofia Kovaleva

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Exact algorithms for procurement problems under a total quantity discount structure.

Dries R. Goossens, A. J. T. Maas, Frits C. R. Spieksma, Joris van de Klundert

Eur. J. Oper. Res., 2007

The tool switching problem revisited.

Yves Crama, Linda S. Moonen, Frits C. R. Spieksma, Ellen Talloen

Eur. J. Oper. Res., 2007

A latency problem with profits.

Sofie Coene, Frits C. R. Spieksma

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems.

Sofia Kovaleva, Frits C. R. Spieksma

SIAM J. Discret. Math., 2006

Exact Algorithms for a Loading Problem with Bounded Clique Width.

Linda S. Moonen, Frits C. R. Spieksma

INFORMS J. Comput., 2006

Modeling and solving the periodic maintenance problem.

Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma

Eur. J. Oper. Res., 2006

Robustness of the Internet at the Topology and Routing Level.

Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic

Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

2005

The no-wait flow-shop paradox.

Frits C. R. Spieksma, Gerhard J. Woeginger

Oper. Res. Lett., 2005

Selecting Telecommunication Carriers to Obtain Volume Discounts.

Joris van de Klundert, Jeroen Kuipers, Frits C. R. Spieksma, Maarten Winkels

Interfaces, 2005

2004

Local search heuristics for multi-index assignment problems with decomposable costs.

Hans-Jürgen Bandelt, A. J. T. Maas, Frits C. R. Spieksma

J. Oper. Res. Soc., 2004

Approximation of Rectangle Stabbing and Interval Stabbing Problems.

Sofia Kovaleva, Frits C. R. Spieksma

Proceedings of the Algorithms, 2004

2003

Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems.

Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger

IEEE Trans. Computers, 2003

Interval selection: Applications, algorithms, and lower bounds.

Thomas Erlebach, Frits C. R. Spieksma

J. Algorithms, 2003

An LP-based algorithm for the data association problem in multitarget tracking.

Patrick P. A. Storms, Frits C. R. Spieksma

Comput. Oper. Res., 2003

Approximation of a Retrieval Problem for Parallel Disks.

Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Primal-dual approximation algorithms for a packing-covering pair of problems.

Sofia Kovaleva, Frits C. R. Spieksma

RAIRO Oper. Res., 2002

Production planning problems in printed circuit board assembly.

Yves Crama, Joris van de Klundert, Frits C. R. Spieksma

Discret. Appl. Math., 2002

2001

The clique partitioning problem: Facets and patching facets.

Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma

Networks, 2001

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Math. Oper. Res., 2001

Approximation of a Geometric Set Covering Problem.

Sofia Kovaleva, Frits C. R. Spieksma

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Solving a bi-criterion cutting stock problem with open-ended demand: a case study.

Antoon W. J. Kolen, Frits C. R. Spieksma

J. Oper. Res. Soc., 2000

Simple Algorithms for a Weighted Interval Selection Problem.

Thomas Erlebach, Frits C. R. Spieksma

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Lifting theorems and facet characterization for a class of clique partitioning inequalities.

Hans-Jürgen Bandelt, Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma

Oper. Res. Lett., 1999

1998

A General Class of Greedily Solvable Linear Programs.

Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella

Math. Oper. Res., 1998

Approximating an Interval Scheduling Problem.

Frits C. R. Spieksma

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.

Maurice Queyranne, Frits C. R. Spieksma

Discret. Appl. Math., 1997

Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Scheduling jobs of equal length: compleixty, facets and computational results.

Yves Crama, Frits C. R. Spieksma

Math. Program., 1996

1995

Scheduling with safety distances.

Frits C. R. Spieksma, Gerhard J. Woeginger, Zhongliang Yu

Ann. Oper. Res., 1995

Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results.

Yves Crama, Frits C. R. Spieksma

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Boltzmann Machines.

Frits C. R. Spieksma

Proceedings of the Artificial Neural Networks: An Introduction to ANN Theory and Practice, 1995

1994

Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.

Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma

Discret. Appl. Math., 1994

A branch-and-bound algorithm for the two-dimensional vector packing problem.

Frits C. R. Spieksma

Comput. Oper. Res., 1994