Hoesel, Stan van (Constantinus Peter Maria), 1961-
Hoesel, Stan van 1961-
Hoesel, Stan van
Stan van Hoesel mathématicien néerlandais
VIAF ID: 306167971 ( Personal )
Permalink: http://viaf.org/viaf/306167971
Preferred Forms
4xx's: Alternate Name Forms (14)
Works
Title | Sources |
---|---|
De constructie van de informatiesnelweg: bit by bit, 2001: | |
Economic lot-sizing: an O(n log n)-algorithm that runs in linear time in the Wagner-whitin case | |
Edge-disjoint homotopic paths in a planar graph with one hole | |
Facet inducing inequalities for single-machine scheduling problems | |
Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems | |
Lifting valid inequalities for the precedence constrained knapsack problem | |
Lower bounds for minimum interference frequency assignment problems | |
An O(n log n) algorithm for the two-machine flow shop problem with controllable machine speeds | |
On solving multi-type line planning problems | |
On the complexity of postoptimality analysis of 0/1 programs | |
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs | |
On the P-coverage problem on the real line | |
Optimising halting station of passenger railway lines | |
Optimization in electronic markets: examples in combinational auctions | |
Optimization in telecommunication networks | |
An overview of Stackelberg pricing in networks | |
Parametric analysis of setup cost in the economic lot-sizing model without speculative motives | |
The partial constraint satisfaction problem: facets and lifting theorems | |
Polyhedral characterization of the economic lot-sizing problem with start-up costs | |
Polyhedral techniques in combinatorial optimization | |
Polynomial cases of the tarification problem | |
Polynomial time algorithms for some multi-level lot-sizing problems with production capacities | |
Routing and multipex bundling in a transmission network | |
Routing trains through a railway station based on a node packing model | |
Solving frequency assignment problems via tree-decomposition | |
Treewidth: computational experiments | |
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions |