Your download is now in progress and you may close this window

Did you know that with a free Taylor & Francis Online account you can gain access to the following benefits?

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Have an account?
Login now Don't have an account?
Register for free

Login or register to access this feature

Have an account?
Login now Don't have an account?
Register for free

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Search in:

Advanced search

Cogent Mathematics Volume 3, 2016 - Issue 1

Submit an article Journal homepage

Open access

2,305

Views

CrossRef citations to date

Altmetric

Research Article

Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm

Elias MunapoGraduate School of Business and Leadership, University of KwaZulu-Natal, Westville Campus, Durban, South AfricaView further author information

Santosh KumarDepartment of Mathematics and Statistics, University of Melbourne, Parkville, AustraliaCorrespondence[email protected] [email protected]
View further author information

Akiko YoshiseUniversity of Tsukuba, JapanView further author information

(Reviewing Editor)

Article: 1162372 | Received 20 Oct 2015, Accepted 27 Feb 2016, Published online: 31 Mar 2016

Cite this article
https://doi.org/10.1080/23311835.2016.1162372
CrossMark

Full Article
Figures & data
References
Citations
Metrics
Licensing
Reprints & Permissions
View PDF PDF

Citations (2)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Articles from other publishers (2)

Elias Munapo & Santosh Kumar. (2021) Reducing the complexity of the knapsack linear integer problem by reformulation techniques. International Journal of System Assurance Engineering and Management 12:6, pages 1087-1093.
Crossref

Masar Al-Rabeeah, Elias Munapo, Ali Al-Hasani, Santosh Kumar & Andrew Eberhard. (2019) Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models. International Journal of Mathematical, Engineering and Management Sciences 4:5, pages 1140-1153.
Crossref

Share icon
Back to Top

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references