The integration of interior-point methods, decomposition concepts and branch-and-bound to solve large scale MIPs Samir Elhedhli Faculty of Management, McGill University 1001 Sherbrooke Street West Montreal, QC, H3A 1G5

First Page		Document Content
Date: 2014-12-10 12:16:01 Combinatorial optimization Mathematics Convex optimization Cutting-plane method Linear programming Branch and price Cutting stock problem Relaxation Interior point method Mathematical optimization Numerical analysis Operations research		The integration of interior-point methods, decomposition concepts and branch-and-bound to solve large scale MIPs Samir Elhedhli Faculty of Management, McGill University 1001 Sherbrooke Street West Montreal, QC, H3A 1G5 Document is deleted from original location. Use the Download Button below to download from the Web Archive. Download Document from Web Archive File Size: 20,32 KB

Document is deleted from original location. Use the Download Button below to download from the Web Archive.