Open AccessNew Hybrid Cutting Plane Method For Solving Integer Linear Programming Problems
Author(s) -
Abbas Al-Bayati,
Nawar Abdullah
Publication year - 2011
Publication title -
maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/al-rafidain journal for computer sciences and mathematics
Language(s) - English
Resource type - Journals
eISSN - 2311-7990
pISSN - 1815-4816
DOI - 10.33899/csmj.2011.163619
Subject(s) - cutting plane method , branch and cut , integer programming , branch and price , linear programming , branch and bound , mathematical optimization , mathematics , integer (computer science) , linear programming relaxation , field (mathematics) , cutting stock problem , algorithm , computer science , optimization problem , pure mathematics , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom