The following pages link to Wilco van den Heuvel (Q299780):
Displaying 32 items.
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- Improving the efficiency of decentralized supply chains with fixed ordering costs (Q322983) (← links)
- (Q545124) (redirect page) (← links)
- Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities'' (Q545126) (← links)
- (Q715059) (redirect page) (← links)
- Integrated market selection and production planning: complexity and solution approaches (Q715060) (← links)
- Economic lot-sizing games (Q852985) (← links)
- Four equivalent lot-sizing models (Q1003497) (← links)
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters (Q1015306) (← links)
- (Q1631525) (redirect page) (← links)
- Robust pooling for contracting models with asymmetric information (Q1631526) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Designing multi-period supply contracts in a two-echelon supply chain with asymmetric information (Q1737492) (← links)
- A note on ``A multi-period profit maximizing model for retail supply chain management'' (Q1753476) (← links)
- A note on ``The economic lot sizing problem with inventory bounds'' (Q1927015) (← links)
- A single-item lot-sizing problem with a by-product and inventory capacities (Q2023969) (← links)
- Economic lot-sizing problem with remanufacturing option: complexity and algorithms (Q2115304) (← links)
- Retrieving a contingency table from a correspondence analysis solution (Q2286973) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- A comparison of methods for lot-sizing in a rolling horizon environment (Q2488200) (← links)
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
- A polynomial time algorithm for a deterministic joint pricing and inventory model (Q2572250) (← links)
- Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics (Q3100450) (← links)
- Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging (Q3120555) (← links)
- Dynamic lot sizing with product returns and remanufacturing (Q3432672) (← links)
- Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models (Q4632846) (← links)
- A new mixed integer programming approach for inverse correspondence analysis (Q6068705) (← links)
- Economic lot sizing problem with tank scheduling (Q6167403) (← links)
- A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning (Q6200120) (← links)
- Multilevel Lot-Sizing with Inventory Bounds (Q6200122) (← links)
- On the uniqueness of correspondence analysis solutions (Q6489368) (← links)
