"A new combinatorial branch-and-bound algorithm for the Knapsack Problem ..."

Stefano Coniglio, Fabio Furini, Pablo San Segundo (2021)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2020.07.023

access: closed

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/ConiglioFS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/ConiglioFS21
Stefano Coniglio, Fabio Furini, Pablo San Segundo:
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. Eur. J. Oper. Res. 289(2): 435-455 (2021)

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.