An Enquiry into an Improved Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph

Additional Metadata
Keywords	knapsack conflict branch bound GPU parallel computing combinatorial optimisation
Thesis Advisor	Hoogervorst, R.
Persistent URL	hdl.handle.net/2105/53587
Series	Econometrie
Organisation	Erasmus School of Economics
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Schouten, V.T. (2020, November 13). An Enquiry into an Improved Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. Econometrie. Retrieved from http://hdl.handle.net/2105/53587

Publication