Sciweavers

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

115

CCE
2005

71views Software Engineering» more CCE 2005»

A cutting plane method for solving linear generalized disjunctive programming problems

15 years 2 months ago

A cutting plane method for solving linear generalized disjunctive programming problems

Download cepac.cheme.cmu.edu

Nicolas W. Sawaya, Ignacio E. Grossmann

Real-time Traffic

CCE 2005 | CCE 2007 |

claim paper

Related Content

» Computations with disjunctive cuts for twostage stochastic mixed 01 integer programs

» Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs

» An InOut Approach to Disjunctive Optimization

» Computational Experience with an Interior Point Cutting Plane Algorithm

» A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimu...

» A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs

» Disjunctive Decomposition for TwoStage Stochastic MixedBinary Programs with Random Recours...

» On the Complexity of Selecting Disjunctions in Integer Programming

» RiskAverse TwoStage Stochastic Linear Programming Modeling and Decomposition

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	CCE
Authors	Nicolas W. Sawaya, Ignacio E. Grossmann

Comments (0)