"An Efficient Semidefinite Programming Relaxation for the Graph Partition ..."

Renata Sotirov (2014)

> Home

Details and statistics

DOI: 10.1287/IJOC.1120.0542

access: closed

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/Sotirov14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/Sotirov14
Renata Sotirov:
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem. INFORMS J. Comput. 26(1): 16-30 (2014)

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.