Sciweavers

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

12

IPCO
2008

favoriteEmaildiscussreport

136views Optimization» more IPCO 2008»

Computing with Multi-row Gomory Cuts

13 years 6 months ago

Computing with Multi-row Gomory Cuts

Download www.dii.uchile.cl

Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cuts. In this paper, we investigate the computational impact of using a subclass of minimally-valid inequalities from this relaxation on a wide set of instances. Key words: mixed integer programming, cutting planes, multiple constraints. 2000 MSC: 90C11, 2000 MSC: 90C57

Daniel G. Espinoza

Real-time Traffic

Infinite Group Relaxation | IPCO 2008 | Mixed Integer Programming | Optimization | Valid Inequalities |

claim paper

Related Content

» MixedInteger Cuts from Cyclic Groups

» Can Pure Cutting Plane Algorithms Work

» On optimizing over liftandproject closures

» On Using Cutting Planes in PseudoBoolean Optimization

» TSP Cuts Which Do Not Conform to the Template Paradigm

» Beyond the Flow Decomposition Barrier

» A SimplexBased Extension of FourierMotzkin for Solving Linear Integer Arithmetic

» Cutting Planes and the Parameter Cutwidth

» The Accuracy of Search Heuristics An Empirical Study on Knapsack Problems

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	IPCO
Authors	Daniel G. Espinoza

Comments (0)