The following pages link to Frits C. R. Spieksma (Q262242):
Displaying 50 items.
- Comparing league formats with respect to match importance in Belgian football (Q1761903) (← links)
- Genetic algorithm for network cost minimization using threshold based discounting (Q1769997) (← links)
- Valid inequalities for a time-indexed formulation (Q1785357) (← links)
- Round-robin tournaments generated by the circle method have maximum carry-over (Q1801003) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- Scheduling with safety distances (Q1897388) (← links)
- Scheduling jobs of equal length: Complexity, facets and computational results (Q1919094) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- The multi-league sports scheduling problem, or how to schedule thousands of matches (Q1984695) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Approximation algorithms for car-sharing problems (Q2019465) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- The traveling social golfer problem: the case of the Volleyball Nations League (Q2117211) (← links)
- In memoriam Gerhard Woeginger (1964--2022) (Q2157912) (← links)
- Parliament seating assignment problems (Q2242347) (← links)
- The accessibility arc upgrading problem (Q2253452) (← links)
- Exact and heuristic methods for placing ships in locks (Q2256280) (← links)
- Scheduling parallel batching machines in a sequence (Q2283298) (← links)
- Scheduling a non-professional indoor football league: a tabu search based approach (Q2327697) (← links)
- Multi-dimensional vector assignment problems (Q2339839) (← links)
- Complexity results for the weak axiom of revealed preference for collective consumption models (Q2348008) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- Modeling and solving the periodic maintenance problem (Q2488905) (← links)
- On the complexity of testing the collective axiom of revealed preference (Q2638309) (← links)
- A project scheduling problem with periodically aggregated resource-constraints (Q2669745) (← links)
- The anchored network covering problem (Q2708103) (← links)
- A general class of greedily solvable linear programs (Q2757571) (← links)
- A polynomial algorithm for multiprocessor scheduling with two job lengths. (Q2757667) (← links)
- Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
- Approximation Algorithms for the Wafer to Wafer Integration Problem (Q2848932) (← links)
- Approximating the Multi-level Bottleneck Assignment Problem (Q2889901) (← links)
- Exact algorithms for a loading problem with bounded clique width (Q2892302) (← links)
- Algorithms for recognizing economic properties in matrix bid combinatorial auctions (Q2899067) (← links)
- The Lockmaster's problem (Q2917255) (← links)
- Heuristics for the traveling repairman problem with profits (Q2917285) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- Balanced Optimization with Vector Costs (Q2971159) (← links)
- On a periodic vehicle routing problem (Q3057746) (← links)
- Connectivity Measures for Internet Topologies on the Level of Autonomous Systems (Q3100404) (← links)
- Charlemagne's Challenge: The Periodic Latency Problem (Q3109870) (← links)
- Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
- Fast Separation Algorithms for Three-Index Assignment Problems (Q3167624) (← links)
- Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over (Q3186501) (← links)
- Interval scheduling: A survey (Q3524590) (← links)
- Between a Rock and a Hard Place: The Two-to-One Assignment Problem (Q3558923) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- (Q4234156) (← links)
