Sciweavers

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

13

COR
2004

favoriteEmaildiscussreport

291views more COR 2004»

Cycling in linear programming problems

13 years 4 months ago

Cycling in linear programming problems

Download osler.irmacs.sfu.ca

We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these problems, we were interested in whether or not some of the more popular linear programming solvers would

Saul I. Gass, Sasirekha Vinjamuri

Real-time Traffic

COR 2004 | Linear Programming | Optimal Solution | Problems |

claim paper

Related Content

» An linear programming based lower bound for the simple assembly line balancing problem

» The inverse 1median problem on a cycle

» Accurate Construction of Consensus Genetic Maps via Integer Linear Programming

» Minimum ratio canceling is oracle polynomial for linear programming but not strongly polyn...

» ILP formulations for pcycle design without candidate cycle enumeration

» A New ILPBased pCycle Construction Algorithm without Candidate Cycle Enumeration

» Optimal Homologous Cycles Total Unimodularity and Linear Programming

» Cycle time and slack optimization for VLSIchips

» Beyond Loose LPRelaxations Optimizing MRFs by Repairing Cycles

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COR
Authors	Saul I. Gass, Sasirekha Vinjamuri

Comments (0)