Pages that link to "Item:Q5704043"

The following pages link to Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems (Q5704043):

Displaying 33 items.

• Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
• A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry (Q322535) (← links)
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← 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)
• Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
• A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
• Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
• A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate (Q1887789) (← links)
• An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Economic lot-sizing problem with remanufacturing option: complexity and algorithms (Q2115304) (← links)
• Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures (Q2251740) (← links)
• A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
• Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← 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)
• Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
• Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
• Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
• An FPTAS for SM‐CELS problem with monotone cost functions (Q3579135) (← links)
• Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)