Frits C. R. Spieksma

According to our database1, Frits C. R. Spieksma authored at least 109 papers between 1994 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Modelling and optimisation in European Kidney Exchange Programmes.
Eur. J. Oper. Res., 2021

Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions.
Bus. Inf. Syst. Eng., 2021

The transportation problem with conflicts.
Ann. Oper. Res., 2021

Online Bin Packing with Overload Cost.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

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

Filling a theatre in times of corona.
CoRR, 2020

The Stackelberg Kidney Exchange Problem is Σ<sub>2</sub><sup>p</sup>-complete.
CoRR, 2020

Approximation Algorithms for Car-Sharing Problems.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Scheduling parallel batching machines in a sequence.
J. Sched., 2019

Online interval scheduling on two related machines: the power of lookahead.
J. Comb. Optim., 2019

No-Wait Scheduling for Locks.
INFORMS J. Comput., 2019

Revealed preference theory: An algorithmic outlook.
Eur. J. Oper. Res., 2019

The sport teams grouping problem.
Ann. Oper. Res., 2019

Scheduling a non-professional indoor football league: a tabu search based approach.
Ann. Oper. Res., 2019

Round-robin tournaments generated by the Circle Method have maximum carry-over.
Math. Program., 2018

Robust balanced optimization.
EURO J. Comput. Optim., 2018

Testing probabilistic models of choice using column generation.
Comput. Oper. Res., 2018

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

Fast separation for the three-index assignment problem.
Math. Program. Comput., 2017

Winner determination in geometrical combinatorial auctions.
Eur. J. Oper. Res., 2017

Exact algorithms for the Equitable Traveling Salesman Problem.
Eur. J. Oper. Res., 2017

Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms.
Oper. Res., 2016

The lockmaster's problem.
Eur. J. Oper. Res., 2016

Mathematical programming models for lock scheduling with an emission objective.
Eur. J. Oper. Res., 2016

Facets of the axial three-index assignment polytope.
Discret. Appl. Math., 2016

The Focus of Attention Problem.
Algorithmica, 2016

Balanced Optimization with Vector Costs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Valid inequalities for a time-indexed formulation.
Oper. Res. Lett., 2015

A Note on Testing Axioms of Revealed Preference.
J. Optim. Theory Appl., 2015

Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms.
ACM Trans. Economics and Comput., 2014

School bus routing - a column generation approach.
Int. Trans. Oper. Res., 2014

Solids: A Combinatorial Auction for Real Estate.
Interfaces, 2014

Exact and heuristic methods for placing ships in locks.
Eur. J. Oper. Res., 2014

The Red-Blue transportation problem.
Eur. J. Oper. Res., 2014

Multi-dimensional vector assignment problems.
Discret. Optim., 2014

Optimal solutions for a dock assignment problem with trailer transportation.
Ann. Oper. Res., 2014

Mathematical programming models for scheduling locks in sequence.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Balancing profits and costs on trees.
Networks, 2013

The three-dimensional matching problem in Kalmanson matrices.
J. Comb. Optim., 2013

A metaheuristic for the school bus routing problem with bus stop selection.
Eur. J. Oper. Res., 2013

The accessibility arc upgrading problem.
Eur. J. Oper. Res., 2013

Heuristics for the traveling repairman problem with profits.
Comput. Oper. Res., 2013

Soccer schedules in Europe: an overview.
J. Sched., 2012

Approximating the multi-level bottleneck assignment problem.
Oper. Res. Lett., 2012

Between a rock and a hard place: the two-to-one assignment problem.
Math. Methods Oper. Res., 2012

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles.
INFORMS J. Comput., 2012

On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies.
INFOR Inf. Syst. Oper. Res., 2012

Computer-assisted proof of performance ratios for the Differencing Method.
Discret. Optim., 2012

The interval ordering problem.
Discret. Appl. Math., 2012

Comparing league formats with respect to match importance in Belgian football.
Ann. Oper. Res., 2012

Approximation Algorithms for the Wafer to Wafer Integration Problem.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Fast Separation Algorithms for Three-Index Assignment Problems.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Breaks, cuts, and patterns.
Oper. Res. Lett., 2011

Charlemagne's Challenge: The Periodic Latency Problem.
Oper. Res., 2011

Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms.
Eur. J. Oper. Res., 2011

Sports scheduling with generalized breaks.
Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Scheduling, 2011

The Lockmaster's problem.
Proceedings of the ATMOS 2011, 2011

Solids - A Combinatorial Auction for a Housing Corporation.
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

Book review.
Oper. Res. Lett., 2010

The approximability of three-dimensional assignment problems with bottleneck objective.
Optim. Lett., 2010

On the complexity of testing the Collective Axiom of Revealed Preference.
Math. Soc. Sci., 2010

On a periodic vehicle routing problem.
J. Oper. Res. Soc., 2010

Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions.
INFORMS J. Comput., 2010

Round robin tournaments and three index assignments.
4OR, 2010

Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

Multi-index Transportation Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Connectivity Measures for Internet Topologies on the Level of Autonomous Systems.
Oper. Res., 2009

Scheduling the Belgian Soccer League.
Interfaces, 2009

Exact algorithms for the matrix bid auction.
Comput. Oper. Res., 2009

The transportation problem with exclusionary side constraints.
4OR, 2009

A note on a motion control problem for a placement machine.
OR Spectr., 2008

Profit-based latency problems on the line.
Oper. Res. Lett., 2008

Partitioning a weighted partial order.
J. Comb. Optim., 2008

Counting and enumerating aggregate classifiers.
Discret. Appl. Math., 2008

A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Exact algorithms for procurement problems under a total quantity discount structure.
Eur. J. Oper. Res., 2007

The tool switching problem revisited.
Eur. J. Oper. Res., 2007

A latency problem with profits.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems.
SIAM J. Discret. Math., 2006

Exact Algorithms for a Loading Problem with Bounded Clique Width.
INFORMS J. Comput., 2006

Modeling and solving the periodic maintenance problem.
Eur. J. Oper. Res., 2006

Robustness of the Internet at the Topology and Routing Level.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

The no-wait flow-shop paradox.
Oper. Res. Lett., 2005

Selecting Telecommunication Carriers to Obtain Volume Discounts.
Interfaces, 2005

Local search heuristics for multi-index assignment problems with decomposable costs.
J. Oper. Res. Soc., 2004

Approximation of Rectangle Stabbing and Interval Stabbing Problems.
Proceedings of the Algorithms, 2004

Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems.
IEEE Trans. Computers, 2003

Interval selection: Applications, algorithms, and lower bounds.
J. Algorithms, 2003

An LP-based algorithm for the data association problem in multitarget tracking.
Comput. Oper. Res., 2003

Approximation of a Retrieval Problem for Parallel Disks.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Primal-dual approximation algorithms for a packing-covering pair of problems.
RAIRO Oper. Res., 2002

Production planning problems in printed circuit board assembly.
Discret. Appl. Math., 2002

The clique partitioning problem: Facets and patching facets.
Networks, 2001

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.
Math. Oper. Res., 2001

Approximation of a Geometric Set Covering Problem.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Solving a bi-criterion cutting stock problem with open-ended demand: a case study.
J. Oper. Res. Soc., 2000

Simple Algorithms for a Weighted Interval Selection Problem.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Lifting theorems and facet characterization for a class of clique partitioning inequalities.
Oper. Res. Lett., 1999

A General Class of Greedily Solvable Linear Programs.
Math. Oper. Res., 1998

Approximating an Interval Scheduling Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.
Discret. Appl. Math., 1997

Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

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

Scheduling with safety distances.
Ann. Oper. Res., 1995

Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

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

Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
Discret. Appl. Math., 1994

A branch-and-bound algorithm for the two-dimensional vector packing problem.
Comput. Oper. Res., 1994