Stan P. M. van Hoesel

According to our database1, Stan P. M. van Hoesel authored at least 33 papers between 1990 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Safe dike heights at minimal costs: An integer programming approach.
Eur. J. Oper. Res., 2018

2017
A column generation based algorithm for the robust graph coloring problem.
Discret. Appl. Math., 2017

2009
Finding good tree decompositions by local search.
Electron. Notes Discret. Math., 2009

2008
An overview of Stackelberg pricing in networks.
Eur. J. Oper. Res., 2008

2007
Tariff Optimization in Networks.
INFORMS J. Comput., 2007

Models and solution techniques for frequency assignment problems.
Ann. Oper. Res., 2007

2006
On solving multi-type railway line planning problems.
Eur. J. Oper. Res., 2006

Optimization Issues in Combinatorial Auctions.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Integrated Lot Sizing in Serial Supply Chains with Production Capacities.
Manag. Sci., 2005

2004
A Branch-and-Cut Approach for Solving Railway Line-Planning Problems.
Transp. Sci., 2004

Pricing Network Edges to Cross a River.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003
Bidirected and unidirected capacity installation in telecommunication networks.
Discret. Appl. Math., 2003

2002
Solving partial constraint satisfaction problems with tree decomposition.
Networks, 2002

Polyhedral results for the edge capacity polytope.
Math. Program., 2002

2001
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems.
Math. Oper. Res., 2001

Routing trains through a railway station based on a node packing model.
Eur. J. Oper. Res., 2001

Treewidth: Computational Experiments.
Electron. Notes Discret. Math., 2001

1999
Lifting valid inequalities for the precedence constrained knapsack problem.
Math. Program., 1999

A polyhedral approach to single-machine scheduling problems.
Math. Program., 1999

Solving Frequency Assignment Problems via Tree-Decomposition<sup>1</sup>.
Electron. Notes Discret. Math., 1999

On the Complexity of Postoptimality Analysis of 0/1 Programs.
Discret. Appl. Math., 1999

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998
The partial constraint satisfaction problem: Facets and lifting theorems.
Oper. Res. Lett., 1998

1997
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs.
Oper. Res. Lett., 1997

1996
Routing Trains Through Railway Stations: Model Formulation and Algorithms.
Transp. Sci., 1996

An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds.
INFORMS J. Comput., 1996

1994
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs.
SIAM J. Discret. Math., 1994

Book reviews.
Math. Methods Oper. Res., 1994

Sensitivity Analysis of List Scheduling Heuristics.
Discret. Appl. Math., 1994

The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming.
Discret. Appl. Math., 1994

1993
Sensitivity Analysis of the Economic Lot-Sizing Problem.
Discret. Appl. Math., 1993

1992
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case.
Oper. Res., 1992

1990
Edge-disjoint homotopic paths in a planar graph with one hole.
J. Comb. Theory, Ser. B, 1990


  Loading...