"Semi-Definite positive Programming Relaxations for Graph ..."

Philippe Meurdesoif, Benoît Rottembourg (2001)

> Home

Details and statistics

DOI: 10.1051/RO:2001112

access: closed

type: Journal Article

metadata version: 2020-09-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/MeurdesoifR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/MeurdesoifR01
Philippe Meurdesoif, Benoît Rottembourg:
Semi-Definite positive Programming Relaxations for Graph K_n-Coloring in Frequency Assignment. RAIRO Oper. Res. 35(2): 211-228 (2001)

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.