Sierksma Gerard

Gerard Sierksma

Information about the author Gerard Sierksma will soon be added to the site.
Found 25 papers in total
Balancing the fit and logistics costs of market segmentations
Balancing the fit and logistics costs of market segmentations
2011
Segments are typically formed to serve distinct groups of consumers with...
The Olympic 500-m speed skating; the inner–outer lane difference
The Olympic 500-m speed skating; the inner–outer lane difference
2010
In 1998, the International Skating Union and the International Olympic Committee...
Training optimization for the decathlon
Training optimization for the decathlon
2009
Decathlon coaches usually spend days or even weeks on designing training schedules for...
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
2007
An automated production system is considered in which several robots are used for...
Iterative patching and the asymmetric traveling salesman problem
Iterative patching and the asymmetric traveling salesman problem
2006
Although Branch-and-Bound (BnB) methods are among the most widely used techniques for...
Sensitivity analysis of a greedy heuristic for knapsack problems
Sensitivity analysis of a greedy heuristic for knapsack problems
2006
In this paper, we carry out parametric analysis as well as a tolerance limit based...
Simplex adjacency graphs in linear optimization
Simplex adjacency graphs in linear optimization
2006
Simplex adjacency graphs represent the possible Simplex pivot operations (the edges)...
The composition of semi-finished inventories at a solid board plant
The composition of semi-finished inventories at a solid board plant
2004
A solid board factory produces rectangular sheets of cardboard in two different...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2004
The simple plant location problem is a well-suited problem in combinatorial...
Team formation: Matching quality supply and quality demand
Team formation: Matching quality supply and quality demand
2003
One of the problems in sports and human resources management is the scouting or...
Complete local search with memory
Complete local search with memory
2002
Neighborhood search heuristics like local search and its variants are some of the most...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2003
The simple plant location problem is a well-studied problem in combinatorial...
Decomposed vs integrated control of a one-stage production system
Decomposed vs integrated control of a one-stage production system
2002
This paper deals with the question: Can the common belief that integrated control is...
The manufacturing of heavy weight cardboard
The manufacturing of heavy weight cardboard
2000
The cardboard company Kappa Graphic Board produces several kinds of cardboard with...
The data-correcting algorithm for the minimization of supermodular functions
The data-correcting algorithm for the minimization of supermodular functions
1999
The Data-Covering (DC) Algorithm is a recursive branch-and-bound type algorithm, in...
Production scheduling across multi-machine packaging lines for the pre-scheduling level
Production scheduling across multi-machine packaging lines for the pre-scheduling level
1999
Scheduling packaging lines in the process industry is a well known hard problem. The...
Solving the k-best traveling salesman problem
Solving the k-best traveling salesman problem
1999
Although k -best solutions for polynomial solvable problems are extensively studied in...
Designing scheduling systems for packaging in process industries: A tobacco company case
Designing scheduling systems for packaging in process industries: A tobacco company case
1998
This paper discusses a number of basic concepts that are important for the design of...
Balinski–Tucker Simplex Tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
Balinski–Tucker Simplex Tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
1998
This paper shows the relationship between degeneracy degrees and multiple solutions in...
Routing helicopters for crew exchanges on off-shore locations
Routing helicopters for crew exchanges on off-shore locations
1998
This paper deals with a vehicle routing problem with split demands, namely the problem...
Faces of diameter two on the Hamilton cycle polytope
Faces of diameter two on the Hamilton cycle polytope
1995
In this paper it is shown that faces of the Hamiltonian cycle polytope (also called...
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
1993
The problem of minimizing and maximizing the objective function of the Traveling...
The skeleton of the symmetric Traveling Salesman Polytope
The skeleton of the symmetric Traveling Salesman Polytope
1993
The vertices of the skeleton of the symmetric Traveling Salesman Polytope are the...
Faces with large diameter on the symmetric traveling salesman polytope
Faces with large diameter on the symmetric traveling salesman polytope
1992
This paper deals with the symmetric traveling salesman polytope and contains three...
Papers per page: