| Document Date: 2016-03-26 12:56:25
Open Document File Size: 216,40 KBShare Result on Facebook
City Lagrangian / New York / St. Louis / / Company S.M. Robinson (eds.) Academic Press / T.C. Hu / Mathematical Programming / Obtaining Dual Solutions / / Currency pence / / Facility Integer Programming Lead P.I. Ted Ralphs Lehigh University / / IndustryTerm by-product / simplex algorithm / software framework / security applications / decomposition algorithms / software suite / optimization algorithm / basic feasible solution / feasible solution / later solution / technology matrix / subgradient algorithm / branch-and-cut algorithm / search strategy / dual decomposition algorithm / distinct feasible solution / parametric and stochastic programming algorithms / search tree / branch-and-bound algorithm / candidate subproblems awaiting processing / generated solutions / additive algorithm / branch-and-cut algorithms / basic algorithm / integer optimization algorithms / multi-criteria optimization algorithms / / Organization CORE / National Science Foundation / London School of Economics / Lehigh University / / Person C. Blair / R. Jeroslow / / / ProgrammingLanguage php / R / / ProvinceOrState Missouri / New York / / RadioStation CORE / / Technology parametric and stochastic programming algorithms / php / Lagrangian-based dual decomposition algorithm / branch-and-cut algorithms / API / subgradient algorithm / simplex algorithm / http / branch-and-cut algorithm / decomposition algorithms / improved algorithm / The algorithm / html / branch-and-bound algorithm / integer optimization algorithms / optimization algorithm / multi-criteria optimization algorithms / additive algorithm / basic algorithm / using the simplex algorithm / / URL www.isye.gatech.edu/∼sahmed/siplib / http /
SocialTag |
NSF GRANT #DMINSF PROGRAM NAME: Small Grants for Exploratory Research Duality and Warm Starting in Integer Programming Lead P.I. Ted Ralphs Lehigh University