"Semidefinite Programming vs. LP Relaxations for Polynomial Programming."

Jean B. Lasserre (2002)

> Home

Details and statistics

DOI: 10.1287/MOOR.27.2.347.322

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/Lasserre02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/Lasserre02
Jean B. Lasserre:
Semidefinite Programming vs. LP Relaxations for Polynomial Programming. Math. Oper. Res. 27(2): 347-360 (2002)

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.