Pages that link to "Item:Q1823857"

The following pages link to Facets and algorithms for capacitated lot sizing (Q1823857):

Displaying 35 items.

• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
• A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
• Restrictive aggregation of items in multi-stage production systems (Q811335) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
• Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study (Q998715) (← links)
• Source sink flows with capacity installation in batches (Q1130180) (← links)
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
• Efficient post-optimization analysis procedure for the dynamic lot-sizing problem (Q1261343) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• Coordination of production and distribution planning (Q1328573) (← links)
• A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand (Q1639278) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• The item dependent stockingcost constraint (Q2009188) (← links)
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem (Q2171582) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
• Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
• Heuristics for the<i>N</i>-product,<i>M</i>-stage, economic lot sizing and scheduling problem with dynamic demand (Q3369501) (← links)
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
• A framework for modelling setup carryover in the capacitated lot sizing problem (Q4399025) (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
• An integrated model for inventory and production planning in a two-stage hybrid production system (Q4706329) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)