Semidefinite Programs and Association Schemes
Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying g...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1999 |
|---|
| Umfang: |
10 |
|---|
| Reproduktion: |
Springer Online Journal Archives 1860-2002 |
|---|---|
| Übergeordnetes Werk: |
in: Computing - 1966, 63(1999) vom: Apr., Seite 331-340 |
| Übergeordnetes Werk: |
volume:63 ; year:1999 ; month:04 ; pages:331-340 ; extent:10 |
| Links: |
|---|
| Katalog-ID: |
NLEJ208077138 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ208077138 | ||
| 003 | DE-627 | ||
| 005 | 20210707004408.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 070528s1999 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)NLEJ208077138 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 245 | 1 | 0 | |a Semidefinite Programs and Association Schemes |
| 264 | 1 | |c 1999 | |
| 300 | |a 10 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. | ||
| 533 | |f Springer Online Journal Archives 1860-2002 | ||
| 700 | 1 | |a Goemans, M. X. |4 oth | |
| 700 | 1 | |a Rendl, F. |4 oth | |
| 773 | 0 | 8 | |i in |t Computing |d 1966 |g 63(1999) vom: Apr., Seite 331-340 |w (DE-627)NLEJ188990208 |w (DE-600)1458946-1 |x 1436-5057 |7 nnns |
| 773 | 1 | 8 | |g volume:63 |g year:1999 |g month:04 |g pages:331-340 |g extent:10 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1007/s006070050038 |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-SOJ | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 63 |j 1999 |c 4 |h 331-340 |g 10 | ||
| matchkey_str |
article:14365057:1999----::eieiiergasnasca |
|---|---|
| hierarchy_sort_str |
1999 |
| publishDate |
1999 |
| allfields |
(DE-627)NLEJ208077138 DE-627 ger DE-627 rakwb eng Semidefinite Programs and Association Schemes 1999 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. Springer Online Journal Archives 1860-2002 Goemans, M. X. oth Rendl, F. oth in Computing 1966 63(1999) vom: Apr., Seite 331-340 (DE-627)NLEJ188990208 (DE-600)1458946-1 1436-5057 nnns volume:63 year:1999 month:04 pages:331-340 extent:10 http://dx.doi.org/10.1007/s006070050038 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 63 1999 4 331-340 10 |
| spelling |
(DE-627)NLEJ208077138 DE-627 ger DE-627 rakwb eng Semidefinite Programs and Association Schemes 1999 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. Springer Online Journal Archives 1860-2002 Goemans, M. X. oth Rendl, F. oth in Computing 1966 63(1999) vom: Apr., Seite 331-340 (DE-627)NLEJ188990208 (DE-600)1458946-1 1436-5057 nnns volume:63 year:1999 month:04 pages:331-340 extent:10 http://dx.doi.org/10.1007/s006070050038 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 63 1999 4 331-340 10 |
| allfields_unstemmed |
(DE-627)NLEJ208077138 DE-627 ger DE-627 rakwb eng Semidefinite Programs and Association Schemes 1999 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. Springer Online Journal Archives 1860-2002 Goemans, M. X. oth Rendl, F. oth in Computing 1966 63(1999) vom: Apr., Seite 331-340 (DE-627)NLEJ188990208 (DE-600)1458946-1 1436-5057 nnns volume:63 year:1999 month:04 pages:331-340 extent:10 http://dx.doi.org/10.1007/s006070050038 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 63 1999 4 331-340 10 |
| allfieldsGer |
(DE-627)NLEJ208077138 DE-627 ger DE-627 rakwb eng Semidefinite Programs and Association Schemes 1999 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. Springer Online Journal Archives 1860-2002 Goemans, M. X. oth Rendl, F. oth in Computing 1966 63(1999) vom: Apr., Seite 331-340 (DE-627)NLEJ188990208 (DE-600)1458946-1 1436-5057 nnns volume:63 year:1999 month:04 pages:331-340 extent:10 http://dx.doi.org/10.1007/s006070050038 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 63 1999 4 331-340 10 |
| allfieldsSound |
(DE-627)NLEJ208077138 DE-627 ger DE-627 rakwb eng Semidefinite Programs and Association Schemes 1999 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. Springer Online Journal Archives 1860-2002 Goemans, M. X. oth Rendl, F. oth in Computing 1966 63(1999) vom: Apr., Seite 331-340 (DE-627)NLEJ188990208 (DE-600)1458946-1 1436-5057 nnns volume:63 year:1999 month:04 pages:331-340 extent:10 http://dx.doi.org/10.1007/s006070050038 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 63 1999 4 331-340 10 |
| language |
English |
| source |
in Computing 63(1999) vom: Apr., Seite 331-340 volume:63 year:1999 month:04 pages:331-340 extent:10 |
| sourceStr |
in Computing 63(1999) vom: Apr., Seite 331-340 volume:63 year:1999 month:04 pages:331-340 extent:10 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| isfreeaccess_bool |
false |
| container_title |
Computing |
| authorswithroles_txt_mv |
Goemans, M. X. @@oth@@ Rendl, F. @@oth@@ |
| publishDateDaySort_date |
1999-04-01T00:00:00Z |
| hierarchy_top_id |
NLEJ188990208 |
| id |
NLEJ208077138 |
| language_de |
englisch |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ208077138</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707004408.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s1999 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ208077138</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Semidefinite Programs and Association Schemes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goemans, M. X.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rendl, F.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">Computing</subfield><subfield code="d">1966</subfield><subfield code="g">63(1999) vom: Apr., Seite 331-340</subfield><subfield code="w">(DE-627)NLEJ188990208</subfield><subfield code="w">(DE-600)1458946-1</subfield><subfield code="x">1436-5057</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:1999</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:331-340</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s006070050038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">1999</subfield><subfield code="c">4</subfield><subfield code="h">331-340</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ208077138</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707004408.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s1999 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ208077138</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Semidefinite Programs and Association Schemes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goemans, M. X.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rendl, F.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">Computing</subfield><subfield code="d">1966</subfield><subfield code="g">63(1999) vom: Apr., Seite 331-340</subfield><subfield code="w">(DE-627)NLEJ188990208</subfield><subfield code="w">(DE-600)1458946-1</subfield><subfield code="x">1436-5057</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:1999</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:331-340</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s006070050038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">1999</subfield><subfield code="c">4</subfield><subfield code="h">331-340</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| series2 |
Springer Online Journal Archives 1860-2002 |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ188990208 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1436-5057 |
| topic_title |
Semidefinite Programs and Association Schemes |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
m x g mx mxg f r fr |
| hierarchy_parent_title |
Computing |
| hierarchy_parent_id |
NLEJ188990208 |
| hierarchy_top_title |
Computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ188990208 (DE-600)1458946-1 |
| title |
Semidefinite Programs and Association Schemes |
| spellingShingle |
Semidefinite Programs and Association Schemes |
| ctrlnum |
(DE-627)NLEJ208077138 |
| title_full |
Semidefinite Programs and Association Schemes |
| journal |
Computing |
| journalStr |
Computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
1999 |
| contenttype_str_mv |
zzz |
| container_start_page |
331 |
| container_volume |
63 |
| physical |
10 |
| format_se |
Elektronische Aufsätze |
| title_sort |
semidefinite programs and association schemes |
| title_auth |
Semidefinite Programs and Association Schemes |
| abstract |
Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. |
| abstractGer |
Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. |
| abstract_unstemmed |
Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme. |
| collection_details |
GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE |
| title_short |
Semidefinite Programs and Association Schemes |
| url |
http://dx.doi.org/10.1007/s006070050038 |
| remote_bool |
true |
| author2 |
Goemans, M. X. Rendl, F. |
| author2Str |
Goemans, M. X. Rendl, F. |
| ppnlink |
NLEJ188990208 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| up_date |
2024-07-06T11:10:56.612Z |
| _version_ |
1803827813142233088 |
| score |
7.399419 |