Pages that link to "Item:Q3737151"

The following pages link to Strong Formulations for Multi-Item Capacitated Lot Sizing (Q3737151):

Displaying 46 items.

• 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)
• Integrated production/distribution planning in supply chains: An invited review (Q1809796) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← 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 application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) (← 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)
• Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
• The item dependent stockingcost constraint (Q2009188) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem (Q2171582) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← 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)
• Capacitated replenishment and disposal planning for multiple products with resalable returns (Q2393488) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Sequential pairing of mixed integer inequalities (Q2471272) (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820) (← links)
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands (Q3144405) (← links)
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes (Q3351124) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems (Q3637368) (← links)
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations (Q3730326) (← links)
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition (Q3780738) (← links)
• Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations (Q4595321) (← links)
• An integrated model for inventory and production planning in a two-stage hybrid production system (Q4706329) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty (Q5086004) (← links)
• Single machine multi-product capacitated lot sizing with sequence-dependent setups (Q5428738) (← 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)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
• Learning optimal solutions via an LSTM-optimization framework (Q6168346) (← links)