Trigonometric approximation of the Max-Cut polytope is star-like
Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. H...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ageron, Romain [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Optimization letters - Springer Berlin Heidelberg, 2007, 16(2022), 6 vom: 03. Feb., Seite 1963-1967 |
|---|---|
| Übergeordnetes Werk: |
volume:16 ; year:2022 ; number:6 ; day:03 ; month:02 ; pages:1963-1967 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11590-021-01842-w |
|---|
| Katalog-ID: |
OLC2078846279 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2078846279 | ||
| 003 | DE-627 | ||
| 005 | 20230506030252.0 | ||
| 007 | tu | ||
| 008 | 221220s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11590-021-01842-w |2 doi | |
| 035 | |a (DE-627)OLC2078846279 | ||
| 035 | |a (DE-He213)s11590-021-01842-w-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |q VZ |
| 100 | 1 | |a Ageron, Romain |e verfasserin |0 (orcid)0000-0003-1393-5238 |4 aut | |
| 245 | 1 | 0 | |a Trigonometric approximation of the Max-Cut polytope is star-like |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 | ||
| 520 | |a Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. | ||
| 650 | 4 | |a Max-Cut polytope | |
| 650 | 4 | |a Trigonometric approximation | |
| 773 | 0 | 8 | |i Enthalten in |t Optimization letters |d Springer Berlin Heidelberg, 2007 |g 16(2022), 6 vom: 03. Feb., Seite 1963-1967 |w (DE-627)527562920 |w (DE-600)2274663-8 |w (DE-576)272713724 |x 1862-4472 |7 nnns |
| 773 | 1 | 8 | |g volume:16 |g year:2022 |g number:6 |g day:03 |g month:02 |g pages:1963-1967 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11590-021-01842-w |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 951 | |a AR | ||
| 952 | |d 16 |j 2022 |e 6 |b 03 |c 02 |h 1963-1967 | ||
| author_variant |
r a ra |
|---|---|
| matchkey_str |
article:18624472:2022----::rgnmtiapoiainfhmxup |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s11590-021-01842-w doi (DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Ageron, Romain verfasserin (orcid)0000-0003-1393-5238 aut Trigonometric approximation of the Max-Cut polytope is star-like 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. Max-Cut polytope Trigonometric approximation Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2022), 6 vom: 03. Feb., Seite 1963-1967 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 https://doi.org/10.1007/s11590-021-01842-w lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2022 6 03 02 1963-1967 |
| spelling |
10.1007/s11590-021-01842-w doi (DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Ageron, Romain verfasserin (orcid)0000-0003-1393-5238 aut Trigonometric approximation of the Max-Cut polytope is star-like 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. Max-Cut polytope Trigonometric approximation Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2022), 6 vom: 03. Feb., Seite 1963-1967 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 https://doi.org/10.1007/s11590-021-01842-w lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2022 6 03 02 1963-1967 |
| allfields_unstemmed |
10.1007/s11590-021-01842-w doi (DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Ageron, Romain verfasserin (orcid)0000-0003-1393-5238 aut Trigonometric approximation of the Max-Cut polytope is star-like 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. Max-Cut polytope Trigonometric approximation Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2022), 6 vom: 03. Feb., Seite 1963-1967 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 https://doi.org/10.1007/s11590-021-01842-w lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2022 6 03 02 1963-1967 |
| allfieldsGer |
10.1007/s11590-021-01842-w doi (DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Ageron, Romain verfasserin (orcid)0000-0003-1393-5238 aut Trigonometric approximation of the Max-Cut polytope is star-like 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. Max-Cut polytope Trigonometric approximation Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2022), 6 vom: 03. Feb., Seite 1963-1967 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 https://doi.org/10.1007/s11590-021-01842-w lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2022 6 03 02 1963-1967 |
| allfieldsSound |
10.1007/s11590-021-01842-w doi (DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Ageron, Romain verfasserin (orcid)0000-0003-1393-5238 aut Trigonometric approximation of the Max-Cut polytope is star-like 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. Max-Cut polytope Trigonometric approximation Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2022), 6 vom: 03. Feb., Seite 1963-1967 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 https://doi.org/10.1007/s11590-021-01842-w lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2022 6 03 02 1963-1967 |
| language |
English |
| source |
Enthalten in Optimization letters 16(2022), 6 vom: 03. Feb., Seite 1963-1967 volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 |
| sourceStr |
Enthalten in Optimization letters 16(2022), 6 vom: 03. Feb., Seite 1963-1967 volume:16 year:2022 number:6 day:03 month:02 pages:1963-1967 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Max-Cut polytope Trigonometric approximation |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Optimization letters |
| authorswithroles_txt_mv |
Ageron, Romain @@aut@@ |
| publishDateDaySort_date |
2022-02-03T00:00:00Z |
| hierarchy_top_id |
527562920 |
| dewey-sort |
3510 |
| id |
OLC2078846279 |
| language_de |
englisch |
| 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">OLC2078846279</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506030252.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-021-01842-w</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078846279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-021-01842-w-p</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="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ageron, Romain</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-1393-5238</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Trigonometric approximation of the Max-Cut polytope is star-like</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Max-Cut polytope</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trigonometric approximation</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">16(2022), 6 vom: 03. Feb., Seite 1963-1967</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6</subfield><subfield code="g">day:03</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1963-1967</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-021-01842-w</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2022</subfield><subfield code="e">6</subfield><subfield code="b">03</subfield><subfield code="c">02</subfield><subfield code="h">1963-1967</subfield></datafield></record></collection>
|
| author |
Ageron, Romain |
| spellingShingle |
Ageron, Romain ddc 510 misc Max-Cut polytope misc Trigonometric approximation Trigonometric approximation of the Max-Cut polytope is star-like |
| authorStr |
Ageron, Romain |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)527562920 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1862-4472 |
| topic_title |
510 VZ Trigonometric approximation of the Max-Cut polytope is star-like Max-Cut polytope Trigonometric approximation |
| topic |
ddc 510 misc Max-Cut polytope misc Trigonometric approximation |
| topic_unstemmed |
ddc 510 misc Max-Cut polytope misc Trigonometric approximation |
| topic_browse |
ddc 510 misc Max-Cut polytope misc Trigonometric approximation |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Optimization letters |
| hierarchy_parent_id |
527562920 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Optimization letters |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 |
| title |
Trigonometric approximation of the Max-Cut polytope is star-like |
| ctrlnum |
(DE-627)OLC2078846279 (DE-He213)s11590-021-01842-w-p |
| title_full |
Trigonometric approximation of the Max-Cut polytope is star-like |
| author_sort |
Ageron, Romain |
| journal |
Optimization letters |
| journalStr |
Optimization letters |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
1963 |
| author_browse |
Ageron, Romain |
| container_volume |
16 |
| class |
510 VZ |
| format_se |
Aufsätze |
| author-letter |
Ageron, Romain |
| doi_str_mv |
10.1007/s11590-021-01842-w |
| normlink |
(ORCID)0000-0003-1393-5238 |
| normlink_prefix_str_mv |
(orcid)0000-0003-1393-5238 |
| dewey-full |
510 |
| title_sort |
trigonometric approximation of the max-cut polytope is star-like |
| title_auth |
Trigonometric approximation of the Max-Cut polytope is star-like |
| abstract |
Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| abstractGer |
Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| abstract_unstemmed |
Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 |
| container_issue |
6 |
| title_short |
Trigonometric approximation of the Max-Cut polytope is star-like |
| url |
https://doi.org/10.1007/s11590-021-01842-w |
| remote_bool |
false |
| ppnlink |
527562920 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11590-021-01842-w |
| up_date |
2024-07-03T22:24:00.601Z |
| _version_ |
1803598367923634176 |
| 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">OLC2078846279</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506030252.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-021-01842-w</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078846279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-021-01842-w-p</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="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ageron, Romain</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-1393-5238</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Trigonometric approximation of the Max-Cut polytope is star-like</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Max-Cut polytope</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trigonometric approximation</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">16(2022), 6 vom: 03. Feb., Seite 1963-1967</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6</subfield><subfield code="g">day:03</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:1963-1967</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-021-01842-w</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2022</subfield><subfield code="e">6</subfield><subfield code="b">03</subfield><subfield code="c">02</subfield><subfield code="h">1963-1967</subfield></datafield></record></collection>
|
| score |
7.398551 |