Sciweavers

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

34

EOR
2007

favoriteEmaildiscussreport

81views more EOR 2007»

A note on the approximability of cutting stock problems

14 years 4 months ago

A note on the approximability of cutting stock problems

Download www.ic.unicamp.br

G. F. Cintra, Flávio Keidi Miyazawa, Yoshik

Real-time Traffic

EOR 2007 |

claim paper

Related Content

» A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs

» Accelerating column generation for variable sized binpacking problems

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Inventory placement in acyclic supply chain networks

» Free Bits PCPs and NonApproximability Towards Tight Results

» Free Bits PCPs and NonapproximabilityTowards Tight Results

» Beating the Random Ordering is Hard Inapproximability of Maximum Acyclic Subgraph

» Boosting Classifiers with Tightened L0Relaxation Penalties

» Deterministic Network Model Revisited An Algebraic Network Coding Approach

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	EOR
Authors	G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier

Comments (0)