A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization 2002-09, Vol.6 (3), p.287-297
Hauptverfasser: BUSYGIN, Stanislav, BUTENKO, Sergiy, PARDALOS, Panos M
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 297
container_issue 3
container_start_page 287
container_title Journal of combinatorial optimization
container_volume 6
creator BUSYGIN, Stanislav
BUTENKO, Sergiy
PARDALOS, Panos M
description
doi_str_mv 10.1023/a:1014899909753
format Article
fullrecord <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_13639084</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>13639084</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-a243fd3ef2180c3e7b74010dade89457ba905e7405f8eec39bbf76af1f80a4b3</originalsourceid><addsrcrecordid>eNotjjtPwzAUhS0EEqUws3phDFzHTmKzVRUUpEos3avr5FoxygvbQcCvJxUs5zV8OozdCrgXkMsHfBQglDbGgKkKecZWoqhklmtdni9Z6jwrDRSX7CrGdwBYsloxt-EtzcHH5GvuxsBTS7zHL9_PPfdDQxMtMiQeKfEpjLajnluM1PBx4OOUfO9_MPlTcRz5x4xNwBNs_KSwDHFqKdA1u3DYRbr59zU7PD8dti_Z_m33ut3sszo3RcowV9I1klwuNNSSKlspENBgQ9qoorK4vKZlK5wmqqWx1lUlOuE0oLJyze7-sBPGGjsXcKh9PE7B9xi-j0KW0oBW8heaQVqX</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere</title><source>SpringerLink Journals</source><creator>BUSYGIN, Stanislav ; BUTENKO, Sergiy ; PARDALOS, Panos M</creator><creatorcontrib>BUSYGIN, Stanislav ; BUTENKO, Sergiy ; PARDALOS, Panos M</creatorcontrib><identifier>ISSN: 1382-6905</identifier><identifier>EISSN: 1573-2886</identifier><identifier>DOI: 10.1023/a:1014899909753</identifier><language>eng</language><publisher>Norwell, MA: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Journal of combinatorial optimization, 2002-09, Vol.6 (3), p.287-297</ispartof><rights>2002 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-a243fd3ef2180c3e7b74010dade89457ba905e7405f8eec39bbf76af1f80a4b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=13639084$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>BUSYGIN, Stanislav</creatorcontrib><creatorcontrib>BUTENKO, Sergiy</creatorcontrib><creatorcontrib>PARDALOS, Panos M</creatorcontrib><title>A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere</title><title>Journal of combinatorial optimization</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>1382-6905</issn><issn>1573-2886</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><recordid>eNotjjtPwzAUhS0EEqUws3phDFzHTmKzVRUUpEos3avr5FoxygvbQcCvJxUs5zV8OozdCrgXkMsHfBQglDbGgKkKecZWoqhklmtdni9Z6jwrDRSX7CrGdwBYsloxt-EtzcHH5GvuxsBTS7zHL9_PPfdDQxMtMiQeKfEpjLajnluM1PBx4OOUfO9_MPlTcRz5x4xNwBNs_KSwDHFqKdA1u3DYRbr59zU7PD8dti_Z_m33ut3sszo3RcowV9I1klwuNNSSKlspENBgQ9qoorK4vKZlK5wmqqWx1lUlOuE0oLJyze7-sBPGGjsXcKh9PE7B9xi-j0KW0oBW8heaQVqX</recordid><startdate>20020901</startdate><enddate>20020901</enddate><creator>BUSYGIN, Stanislav</creator><creator>BUTENKO, Sergiy</creator><creator>PARDALOS, Panos M</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>20020901</creationdate><title>A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere</title><author>BUSYGIN, Stanislav ; BUTENKO, Sergiy ; PARDALOS, Panos M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-a243fd3ef2180c3e7b74010dade89457ba905e7405f8eec39bbf76af1f80a4b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>BUSYGIN, Stanislav</creatorcontrib><creatorcontrib>BUTENKO, Sergiy</creatorcontrib><creatorcontrib>PARDALOS, Panos M</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Journal of combinatorial optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>BUSYGIN, Stanislav</au><au>BUTENKO, Sergiy</au><au>PARDALOS, Panos M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere</atitle><jtitle>Journal of combinatorial optimization</jtitle><date>2002-09-01</date><risdate>2002</risdate><volume>6</volume><issue>3</issue><spage>287</spage><epage>297</epage><pages>287-297</pages><issn>1382-6905</issn><eissn>1573-2886</eissn><cop>Norwell, MA</cop><pub>Springer</pub><doi>10.1023/a:1014899909753</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1382-6905
ispartof Journal of combinatorial optimization, 2002-09, Vol.6 (3), p.287-297
issn 1382-6905
1573-2886
language eng
recordid cdi_pascalfrancis_primary_13639084
source SpringerLink Journals
subjects Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
title A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T07%3A06%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20heuristic%20for%20the%20maximum%20independent%20set%20problem%20based%20on%20optimization%20of%20a%20quadratic%20over%20a%20sphere&rft.jtitle=Journal%20of%20combinatorial%20optimization&rft.au=BUSYGIN,%20Stanislav&rft.date=2002-09-01&rft.volume=6&rft.issue=3&rft.spage=287&rft.epage=297&rft.pages=287-297&rft.issn=1382-6905&rft.eissn=1573-2886&rft_id=info:doi/10.1023/a:1014899909753&rft_dat=%3Cpascalfrancis%3E13639084%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true