"An efficient algorithm for the complete set partitioning problem."

Chien-Hua M. Lin, Harvey M. Salkin (1983)

> Home

Details and statistics

DOI: 10.1016/0166-218X(83)90069-0

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/LinS83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/LinS83
Chien-Hua M. Lin, Harvey M. Salkin:
An efficient algorithm for the complete set partitioning problem. Discret. Appl. Math. 6(2): 149-156 (1983)

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.