Sciweavers

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

77

Voted

COR
2007

69views more COR 2007»

On separating cover inequalities for the multidimensional knapsack problem

15 years 2 months ago

On separating cover inequalities for the multidimensional knapsack problem

Download www.optimization-online.org

Tolga Bektas, Osman Oguz

Real-time Traffic

COR 2007 |

claim paper

Related Content

» Local and global lifted cover inequalities for the 01 multidimensional knapsack problem

» Separation algorithms for 01 knapsack polytopes

» Capacitated facility location Separation algorithms and computational experience

» Facets of the Complementarity Knapsack Polytope

» Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions

» On the Exact Separation of Mixed Integer Knapsack Cuts

» The complexity of cover inequality separation

» The network inhibition problem

» On a Generalization of the Master Cyclic Group Polyhedron

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COR
Authors	Tolga Bektas, Osman Oguz

Comments (0)