"An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS ..."

John W. Chinneck (1996)

> Home

Details and statistics

DOI: 10.1007/BF02284627

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/Chinneck96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Chinneck96
John W. Chinneck:
An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem. Ann. Math. Artif. Intell. 17(1-2): 127-144 (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.