"Separating Clique Trees and Bipartition Inequalities Having a Fixed Number ..."

Robert Carr (1997)

> Home

Details and statistics

DOI: 10.1287/MOOR.22.2.257

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/Carr97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/Carr97
Robert Carr:
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. Math. Oper. Res. 22(2): 257-265 (1997)

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.