Sciweavers

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

5

ORL
2008

favoriteEmaildiscussreport

74views more ORL 2008»

Bounds on the size of branch-and-bound proofs for integer knapsacks

13 years 4 months ago

Bounds on the size of branch-and-bound proofs for integer knapsacks

Download www.math.wsu.edu

Bala Krishnamoorthy

Real-time Traffic

ORL 2008 |

claim paper

Related Content

» Playing in the grey area of proofs

» Generalized Assignment Problems

» Powering requires threshold depth 3

» Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters

» Kernelization of packing problems

» Sampling Bounds for Stochastic Optimization

» Distance Oracles for Sparse Graphs

» Almost Uniform Density of Power Residues and the Provable Security of ESIGN

» Helly numbers of acyclic families

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	ORL
Authors	Bala Krishnamoorthy

Comments (0)