Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Crossref DOI link: https://doi.org/10.1007/s00186-019-00664-y
Published Online: 2019-03-19
Published Print: 2019-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gurski, Frank
Rehs, Carolin
Funding for this research was provided by:
Deutsche Forschungsgemeinschaft (GU 970/7-1)
Text and Data Mining valid from 2019-03-19
Article History
Received: 19 June 2018
Accepted: 8 March 2019
First Online: 19 March 2019