Back to Results
First PageMeta Content
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
Add to Reading List

Document Date: 2014-12-10 12:16:01

Open Document

File Size: 20,32 KB

Share Result on Facebook

City

Quebec City / Montreal / Lagrangean / linear programming / /

Company

SIAM Journal / /

Facility

McGill University / /

IndustryTerm

branch-and-bound search scheme / transportation problems / incumbent feasible solutions / real-life applications / branch-and-price algorithm / branch-and-bound algorithms / search scheme / /

Organization

McGill University / MIPs Samir Elhedhli Faculty of Management / /

Person

Samir Elhedhli / /

ProvinceOrState

Quebec / /

Technology

Projective Algorithm / Interior-point Cutting Plane Algorithm / Linear Programming-Based Algorithms / branch-and-price algorithm / branch-and-bound algorithms / Optimization Algorithm / IP-B&P algorithm / /

SocialTag