Pages that link to "Item:Q3168976"

The following pages link to Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities (Q3168976):

Displaying 21 items.

• Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
• Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations (Q3730326) (← 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)
• Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
• A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• (Q5091246) (← links)
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)