The following pages link to bc-prod (Q22621):
Displaying 39 items.
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
- Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis) (Q1878999) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
- Manufacturer's mixed pallet design problem (Q2462174) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Approximate extended formulations (Q2583138) (← links)
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs (Q3114714) (← links)
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820) (← links)
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems (Q3116760) (← links)
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands (Q3144405) (← links)
- (Q3378954) (← links)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
- A Backward Sampling Framework for Interdiction Problems with Fortification (Q5739135) (← links)
