Sciweavers

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

11

MP
2002

favoriteEmaildiscussreport

48views more MP 2002»

Maximum stable set formulations and heuristics based on continuous optimization

13 years 4 months ago

Maximum stable set formulations and heuristics based on continuous optimization

Download dollar.biz.uiowa.edu

The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov

Samuel Burer, Renato D. C. Monteiro, Yin Zhang

Real-time Traffic

Lov´asz Semidefinite Program | MP 2002 | Optimal Value | Semidefinite Program |

claim paper

Related Content

» Mixed Integer Linear Programming for MaximumParsimony Phylogeny Inference

» Continuous GRASP with a local activeset method for boundconstrained global optimization

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» Railway Track Allocation by Rapid Branching

» Solution of the Train Platforming Problem

» Register placement for highperformance circuits

» Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balan...

» Mining discrete patterns via binary matrix factorization

» Optimal control of epidemic evolution

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	MP
Authors	Samuel Burer, Renato D. C. Monteiro, Yin Zhang

Comments (0)