The following pages link to Raf Jans (Q299779):
Displayed 33 items.
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Efficient symmetry breaking formulations for the job grouping problem (Q340336) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem (Q1634095) (← links)
- A decomposition heuristic for a rich production routing problem (Q1651659) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- Alternative formulations for a layout problem in the fashion industry (Q1848631) (← links)
- A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← links)
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- A note on a symmetrical set covering problem: the lottery problem (Q2462109) (← links)
- Analysis of an industrial component commonality problem (Q2462172) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Integrated lot sizing and blending problems (Q2668689) (← links)
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints (Q2901053) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times (Q3392124) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems (Q5106415) (← links)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Combining Column Generation and Lagrangian Relaxation (Q5493634) (← links)
- The consistent production routing problem (Q6064169) (← links)
- Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← links)
- A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint (Q6146574) (← links)