IMT-2000 mobility
Summary form only given. This article consists of a collection of slides from the author's PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal soluti...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 435 |
|---|---|
| container_issue | |
| container_start_page | 412 |
| container_title | |
| container_volume | |
| creator | Yun-Chao Hu |
| description | Summary form only given. This article consists of a collection of slides from the author's PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal solutions, contrarily to the nonlinear formulation. An alternative disjunctive formulation was proposed which is better conditioned giving significant reduction of computational effort. The upper bound provided by GRASP metaheuristic allows solving hard problem instances and even proving optimality by reducing the B&B search tree. |
| doi_str_mv | 10.1109/INW.2000.868218 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_868218</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>868218</ieee_id><sourcerecordid>868218</sourcerecordid><originalsourceid>FETCH-ieee_primary_8682183</originalsourceid><addsrcrecordid>eNpjYBA3NNAzNDSw1Pf0C9czMjAw0LMwszAytGBm4DIwtzAwNjM2NDflYOAtLs4CShoYW5qaGJpyMgh6-obogpQr5OYnZeZkllTyMLCmJeYUp_JCaW4GKTfXEGcP3czU1NT4gqLM3MSiyniI4cZ4JQGlCiUs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>IMT-2000 mobility</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yun-Chao Hu</creator><creatorcontrib>Yun-Chao Hu</creatorcontrib><description>Summary form only given. This article consists of a collection of slides from the author's PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal solutions, contrarily to the nonlinear formulation. An alternative disjunctive formulation was proposed which is better conditioned giving significant reduction of computational effort. The upper bound provided by GRASP metaheuristic allows solving hard problem instances and even proving optimality by reducing the B&B search tree.</description><identifier>ISBN: 0780363175</identifier><identifier>ISBN: 9780780363175</identifier><identifier>DOI: 10.1109/INW.2000.868218</identifier><language>eng</language><publisher>IEEE</publisher><ispartof>Proceedings 2000 IEEE Intelligent Network Workshop, 2000, p.412-435</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/868218$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/868218$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yun-Chao Hu</creatorcontrib><title>IMT-2000 mobility</title><title>Proceedings 2000 IEEE Intelligent Network Workshop</title><addtitle>INW</addtitle><description>Summary form only given. This article consists of a collection of slides from the author's PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal solutions, contrarily to the nonlinear formulation. An alternative disjunctive formulation was proposed which is better conditioned giving significant reduction of computational effort. The upper bound provided by GRASP metaheuristic allows solving hard problem instances and even proving optimality by reducing the B&B search tree.</description><isbn>0780363175</isbn><isbn>9780780363175</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpjYBA3NNAzNDSw1Pf0C9czMjAw0LMwszAytGBm4DIwtzAwNjM2NDflYOAtLs4CShoYW5qaGJpyMgh6-obogpQr5OYnZeZkllTyMLCmJeYUp_JCaW4GKTfXEGcP3czU1NT4gqLM3MSiyniI4cZ4JQGlCiUs</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Yun-Chao Hu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2000</creationdate><title>IMT-2000 mobility</title><author>Yun-Chao Hu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_8682183</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Yun-Chao Hu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yun-Chao Hu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>IMT-2000 mobility</atitle><btitle>Proceedings 2000 IEEE Intelligent Network Workshop</btitle><stitle>INW</stitle><date>2000</date><risdate>2000</risdate><spage>412</spage><epage>435</epage><pages>412-435</pages><isbn>0780363175</isbn><isbn>9780780363175</isbn><abstract>Summary form only given. This article consists of a collection of slides from the author's PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal solutions, contrarily to the nonlinear formulation. An alternative disjunctive formulation was proposed which is better conditioned giving significant reduction of computational effort. The upper bound provided by GRASP metaheuristic allows solving hard problem instances and even proving optimality by reducing the B&B search tree.</abstract><pub>IEEE</pub><doi>10.1109/INW.2000.868218</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0780363175 |
| ispartof | Proceedings 2000 IEEE Intelligent Network Workshop, 2000, p.412-435 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_868218 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| title | IMT-2000 mobility |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T13%3A04%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=IMT-2000%20mobility&rft.btitle=Proceedings%202000%20IEEE%20Intelligent%20Network%20Workshop&rft.au=Yun-Chao%20Hu&rft.date=2000&rft.spage=412&rft.epage=435&rft.pages=412-435&rft.isbn=0780363175&rft.isbn_list=9780780363175&rft_id=info:doi/10.1109/INW.2000.868218&rft_dat=%3Cieee_6IE%3E868218%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=868218&rfr_iscdi=true |