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

Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti (2017)

> Home

Details and statistics

DOI: 10.1287/IJOC.2016.0742

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/BettinelliCM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/BettinelliCM17
Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti:
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. INFORMS J. Comput. 29(3): 457-473 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.