"From Linear to Semidefinite Programming: An Algorithm to Obtain ..."

Frédéric Roupin (2004)

> Home

Details and statistics

DOI: 10.1007/S10878-004-4838-6

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Roupin04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Roupin04
Frédéric Roupin:
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. Comb. Optim. 8(4): 469-493 (2004)

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.