"The critical-item, upper bounds, and a branch-and-bound algorithm for the ..."

Dong X. Shaw, Geon Cho (1998)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199807)31:4<205::AID-NET1>3.0.CO;2-H

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/ShawC98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ShawC98
Dong X. Shaw, Geon Cho:
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. Networks 31(4): 205-216 (1998)

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.