| Document Date: 2013-03-11 13:59:51
Open Document File Size: 767,25 KBShare Result on Facebook
Company Hanan Mahmoud (hamahmou@connect.carleton.ca) John W. Chinneck (chinneck@sce.carleton.ca) Systems / Intel / Microsoft / B A LP / / Country Canada / / / Event FDA Phase / / Facility Computer Engineering Carleton University / / IndustryTerm disjunction algorithms / relaxation solution / tree search / integer-feasible solution / search trees / node pre-processing / neighbourhood search heuristic / feasible solution / integer solutions / dot product / root node solution / overall solution / search tree / possible solutions / bound algorithms / heuristic search procedure / optimum solution / rounded integer solution / feasible solutions / / OperatingSystem XP / Microsoft Windows / / Organization Systems and Computer Engineering Carleton University Ottawa / U.S. Securities and Exchange Commission / / Position General / Achieving MILP Feasibility Quickly Using General / / Product Cplex C API / LP solution / / ProvinceOrState Ontario / / Technology RAM / API / disjunction algorithms / B&B algorithms / /
SocialTag |
Computers and Operations Research (2013), to appear. Achieving MILP Feasibility Quickly Using General Disjunctions Hanan Mahmoud ([removed]) John W. Chinneck ([removed]) Systems and Com