A Branch-and-Bound Algorithm for the Knapsack Problem with...

INFORMS Journal on Computing 2017 / 08 Vol. 29; Iss. 3

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph

Bettinelli, Andrea, Cacchiani, Valentina, Malaguti, Enrico
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
29
Language:
english
Journal:
INFORMS Journal on Computing
DOI:
10.1287/ijoc.2016.0742
Date:
August, 2017
File:
PDF, 438 KB
english, 2017
Conversion to is in progress
Conversion to is failed