Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

IPCO
1996

favoriteEmaildiscussreport

73views Optimization» more IPCO 1996»

Improved Randomized Approximation Algorithms for Lot-Sizing Problems

13 years 5 months ago

Improved Randomized Approximation Algorithms for Lot-Sizing Problems

Download web.mit.edu

Chung-Piaw Teo, Dimitris Bertsimas

Real-time Traffic

IPCO 1996 | IPCO 2007 |

claim paper

Related Content

» Dynamic lot sizing and tool management in automated manufacturing systems

» Improved Approximation Algorithms for Bipartite Correlation Clustering

» Improved approximation algorithms for multidimensional bin packing problems

» An Improved Randomized Approximation Algorithm for Maximum Triangle Packing

» Near optimal online algorithms and fast approximation algorithms for resource allocation p...

» Improved Approximation Algorithms for Maximum Graph Partitioning Problems

» Improved Approximation Algorithms for Label Cover Problems

» Approximating connected facility location problems via random facility sampling and core d...

» Improved Randomized Results for That Interval Selection Problem

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	IPCO
Authors	Chung-Piaw Teo, Dimitris Bertsimas

Comments (0)