| Publication | Date of Publication | Type |
|---|
Truly tight bounds for TSP heuristics
Operations Research Letters | 2023-09-12 | Paper |
Local improvement algorithms for a path packing problem: a performance analysis based on linear programming
Operations Research Letters | 2021-04-07 | Paper |
Column generation based heuristic for learning classification trees
Computers & Operations Research | 2020-01-27 | Paper |
Integer programming models for mid-term production planning for high-tech low-volume supply chains
European Journal of Operational Research | 2018-05-17 | Paper |
Coloring graphs using two colors while avoiding monochromatic cycles
INFORMS Journal on Computing | 2016-06-29 | Paper |
Stable multi-skill workforce assignments
Annals of Operations Research | 2014-09-26 | Paper |
Realizing small tournaments through few permutations
Acta Cybernetica | 2014-05-05 | Paper |
An improved MIP-based approach for a multi-skill workforce scheduling problem
Journal of Scheduling | 2014-02-05 | Paper |
Complexity and approximation of an area packing problem
Optimization Letters | 2012-11-30 | Paper |
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
Annals of Operations Research | 2012-11-15 | Paper |
Cinderella versus the wicked stepmother
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
INFORMS Journal on Computing | 2012-06-08 | Paper |
Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
INFORMS Journal on Computing | 2012-05-30 | Paper |
The Alcuin number of a graph and its connections to the vertex cover number
SIAM Review | 2012-04-05 | Paper |
The Cinderella Game on Holes and Anti-holes
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
How Cinderella won the bucket game (and lived happily ever after)
Mathematics Magazine | 2011-12-07 | Paper |
A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
Probability in the Engineering and Informational Sciences | 2011-08-17 | Paper |
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
The c game revisited
Information Processing Letters | 2010-06-09 | Paper |
Timetabling problems at the TU Eindhoven
European Journal of Operational Research | 2009-12-07 | Paper |
Process discovery using integer linear programming
Fundamenta Informaticae | 2009-11-30 | Paper |
Incorporating the strength of MIP modeling in schedule construction
RAIRO - Operations Research | 2009-11-12 | Paper |
Incorporating the strength of MIP modeling in schedule construction
RAIRO - Operations Research | 2009-11-12 | Paper |
| scientific article; zbMATH DE number 5605102 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5605111 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5605143 (Why is no real title available?) | 2009-09-19 | Paper |
Optimal packet-to-slot assignment in mobile telecommunications
Operations Research Letters | 2009-08-14 | Paper |
Algorithms for Radio Link Frequency Assignment: The Calma Project
Operations Research | 2009-07-03 | Paper |
The hardness of train rearrangements
Operations Research Letters | 2009-05-07 | Paper |
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions
Information Processing Letters | 2009-03-23 | Paper |
The Alcuin Number of a Graph
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Process Discovery Using Integer Linear Programming
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Prefix Reversals on Binary and Ternary Strings
Algebraic Biology | 2007-11-29 | Paper |
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Timetabling problems at the TU Eindhoven
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Linear programming models with planned lead times for supply chain operations planning
European Journal of Operational Research | 2005-02-09 | Paper |
On the nearest neighbor rule for the traveling salesman problem
Operations Research Letters | 2004-07-01 | Paper |
Approximation algorithms for the test cover problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Operations Research Letters | 2003-11-17 | Paper |
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
INFORMS Journal on Computing | 2003-10-28 | Paper |
| Whizzkids: Two exercises in computational discrete optimization | 2003-07-15 | Paper |
Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
Mathematics of Operations Research | 2001-11-26 | Paper |
Local search algorithms for the radio link frequency assignment problem
Telecommunication Systems | 2000-01-01 | Paper |
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
INFORMS Journal on Computing | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1342116 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1187155 (Why is no real title available?) | 1998-08-10 | Paper |
Short Shop Schedules
Operations Research | 1998-07-06 | Paper |
Fast movement strategies for a step‐and‐scan wafer stepper
Statistica Neerlandica | 1997-11-25 | Paper |
A branch-and-price algorithm for solving the cutting strips problem
Applied Mathematics. Series B (English Edition) | 1997-08-28 | Paper |
| scientific article; zbMATH DE number 997663 (Why is no real title available?) | 1997-04-09 | Paper |
Approximation Algorithms for the k-Clique Covering Problem
SIAM Journal on Discrete Mathematics | 1997-02-26 | Paper |
| scientific article; zbMATH DE number 125460 (Why is no real title available?) | 1993-02-21 | Paper |
| scientific article; zbMATH DE number 15085 (Why is no real title available?) | 1992-06-25 | Paper |
On the diameter of the edge cover polytope
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
Blowing up convex sets in the plane
Linear Algebra and its Applications | 1990-01-01 | Paper |
On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
On fractional multicommodity flows and distance functions
Discrete Mathematics | 1989-01-01 | Paper |
On the existence of an integral potential in a weighted bidirected graph
Linear Algebra and its Applications | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4191716 (Why is no real title available?) | 1988-01-01 | Paper |
Conference matrices from projective planes of order 9
European Journal of Combinatorics | 1985-01-01 | Paper |
