"Using dual network bounds in algorithms for solving generalized set ..."

Naum Z. Shor, Yu. V. Voitishin, V. M. Glushkov (1996)

> Home

Details and statistics

DOI: 10.1007/BF00247796

access: closed

type: Journal Article

metadata version: 2020-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/ShorVG96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/ShorVG96
Naum Z. Shor, Yu. V. Voitishin, V. M. Glushkov:
Using dual network bounds in algorithms for solving generalized set packing partitioning problems. Comput. Optim. Appl. 6(3): 293-303 (1996)

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.