"Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems."

Carlton E. Lemke, H. M. Salkin, Kurt Spielberg (1971)

> Home

Details and statistics

DOI: 10.1287/OPRE.19.4.998

access: closed

type: Journal Article

metadata version: 2020-03-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ior/LemkeSS71
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/LemkeSS71
Carlton E. Lemke, H. M. Salkin, Kurt Spielberg:
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems. Oper. Res. 19(4): 998-1022 (1971)

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.