Pages that link to "Item:Q1262197"

The following pages link to An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197):

Displaying 27 items.

• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
• Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
• Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
• An efficient algorithm for the dynamic economic lot size problem (Q1206386) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
• A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
• An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
• Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
• An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
• An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs (Q2783984) (← links)
• Analysis of a dynamic lot-sizing problem with production capacity constraint (Q2816376) (← links)
• Algorithms for the multi-item multi-vehicles dynamic lot sizing problem (Q3423273) (← links)
• An <i>O</i>(<i>T</i>²) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896) (← links)
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs (Q4305773) (← links)
• ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت (Q4615735) (← links)
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050) (← links)
• Lot sizing with bounded inventory and lost sales (Q5451189) (← links)