The following pages link to (Q4139966):
Displaying 50 items.
- Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372) (← links)
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Influence of consumer purchasing behaviour on the production planning of perishable food (Q480758) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
- Integrated market selection and production planning: complexity and solution approaches (Q715060) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← 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)
- Uncapacitated two-level lot-sizing (Q991455) (← links)
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) (← links)
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- A general quantity discount and supplier selection mixed integer programming model (Q1018258) (← links)
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) (← links)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (Q1278343) (← links)
- Dynamic lot-sizing with price changes and price-dependent holding costs (Q1303747) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- Capacity expansion with alternative technology choices (Q1333530) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results (Q1761836) (← links)
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Multi-stage simultaneous lot-sizing and scheduling for flow line production (Q1936588) (← links)
- A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- Set characterizations and convex extensions for geometric convex-hull proofs (Q2089779) (← links)
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
- Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty (Q2160510) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
