C
C.P.M. van Hoesel
Researcher at Maastricht University
Publications - 35
Citations - 1079
C.P.M. van Hoesel is an academic researcher from Maastricht University. The author has contributed to research in topics: Optimization problem & Convex hull. The author has an hindex of 16, co-authored 35 publications receiving 1054 citations.
Papers
More filters
Posted Content
Routing trains through a railway station based on a Node Packing model
TL;DR: An algorithm for solving the problem of routing trains through a railway station in the Netherlands in terms of a Weighted Node Packing Problem is described, based on preprocessing, valid inequalities, and a branch-and-cut approach.
An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities
TL;DR: An algorithm is developed that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding costs in $O(T^3)$ time and improves upon the running time of an earlier algorithm.
Journal ArticleDOI
An O (T 3 ) algorithm for the economic lot-sizing problem with constant capacities
TL;DR: In this article, the authors developed an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding in OT3 time, which is based on the standard dynamic programming approach which requires the computation of the minimal costs for all possible subplans of the production plan.
Journal ArticleDOI
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
TL;DR: This paper shows the existence of fully polynomial approximation schemes for single-item capacitated lot-sizing problems, and discusses important special cases of the model and extensions of the approximation scheme to even more general models.
Journal ArticleDOI
A polyhedral approach to single-machine scheduling problems
TL;DR: This work gives complete characterizations of all facet inducing inequalities with integral coefficients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules, i.e., schedules in which all jobs have to be started.