Stan P. M. van Hoesel

From MaRDI portal
Person:516836

Available identifiers

zbMath Open van-hoesel.stan-p-mWikidataQ18921911 ScholiaQ18921911MaRDI QIDQ516836

List of research outcomes

PublicationDate of PublicationType
Safe dike heights at minimal costs: an integer programming approach2018-05-31Paper
A column generation based algorithm for the robust graph coloring problem2017-03-15Paper
https://portal.mardi4nfdi.de/entity/Q28160282016-07-01Paper
Finding good tree decompositions by local search2013-07-04Paper
Tariff Optimization in Networks2012-06-18Paper
Integrated Lot Sizing in Serial Supply Chains with Production Capacities2012-02-21Paper
An overview of Stackelberg pricing in networks2008-04-24Paper
Models and solution techniques for frequency assignment problems2008-03-31Paper
Pricing bridges to cross a river2008-01-18Paper
On the p‐coverage problem on the real line2007-10-26Paper
https://portal.mardi4nfdi.de/entity/Q52940842007-07-23Paper
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems2005-11-11Paper
On solving multi-type railway line planning problems2005-10-17Paper
Optimization in telecommunication networks2005-09-01Paper
Models and solution techniques for frequency assignment problems2004-02-19Paper
Bidirected and unidirected capacity installation in telecommunication networks.2004-01-05Paper
Solving partial constraint satisfaction problems with tree decomposition2002-12-17Paper
Routing trains through a railway station based on a node packing model2002-04-11Paper
Polyhedral results for the edge capacity polytope.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27413472001-09-23Paper
A polyhedral approach to single-machine scheduling problems.2000-11-12Paper
Polyhedral techniques in combinatorial optimization II: applications and computations2000-04-25Paper
On the complexity of postoptimality analysis of \(0/1\) programs1999-08-05Paper
Lifting valid inequalities for the precedence constrained knapsack problem1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43437001998-02-05Paper
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs1998-01-15Paper
An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds1998-01-14Paper
The partial constraint satisfaction problem: Facets and lifting theorems1998-01-01Paper
Routing Trains Through Railway Stations: Model Formulation and Algorithms1997-12-14Paper
An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities1996-11-25Paper
Polyhedral techniques in combinatorial optimization I: Theory1996-11-18Paper
Sensitivity analysis of list scheduling heuristics1995-10-10Paper
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions1995-02-19Paper
A linear description of the discrete lot-sizing and scheduling problem1994-08-21Paper
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs1994-05-12Paper
The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming1994-03-24Paper
Sensitivity analysis of the economic lot-sizing problem1994-01-09Paper
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case1992-06-28Paper
A dual algorithm for the economic lot-sizing problem1992-06-25Paper
A note on Stability of the constant cost dynamic lot size model by K. Richter1991-01-01Paper
Edge-disjoint homotopic paths in a planar graph with one hole1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52028181990-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stan P. M. van Hoesel