The following pages link to Stan P. M. van Hoesel (Q516836):
Displaying 37 items.
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- (Q807372) (redirect page) (← links)
- A note on ''Stability of the constant cost dynamic lot size model'' by K. Richter (Q807374) (← links)
- (Q1097899) (redirect page) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- A dual algorithm for the economic lot-sizing problem (Q1175307) (← links)
- (Q1283801) (redirect page) (← links)
- On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- Sensitivity analysis of the economic lot-sizing problem (Q1309816) (← links)
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- Sensitivity analysis of list scheduling heuristics (Q1339396) (← links)
- (Q1374378) (redirect page) (← links)
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- A polyhedral approach to single-machine scheduling problems. (Q1586211) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Polyhedral results for the edge capacity polytope. (Q1611010) (← links)
- (Q1754752) (redirect page) (← links)
- Safe dike heights at minimal costs: an integer programming approach (Q1754753) (← links)
- Lifting valid inequalities for the precedence constrained knapsack problem (Q1806031) (← links)
- An overview of Stackelberg pricing in networks (Q2482810) (← links)
- On solving multi-type railway line planning problems (Q2569037) (← links)
- (Q2741347) (← links)
- (Q2816028) (← links)
- Finding good tree decompositions by local search (Q2839209) (← links)
- Tariff Optimization in Networks (Q2892359) (← links)
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities (Q3115939) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Solving partial constraint satisfaction problems with tree decomposition (Q4785233) (← links)
- An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities (Q4887780) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- On the <i>p</i>‐coverage problem on the real line (Q5422012) (← links)
- Pricing bridges to cross a river (Q5436961) (← links)
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems (Q5704043) (← links)
