有限资源下最大可靠性网络流中断模型
提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资源限制下，最大化中断网络流的可能性，即给定起点和终点的网络图，在资源有限的情况下，选择一些边设置监测点使得从起点到终点的所有路都包含尽可能多的已被设置中断点的边。在给定图中，两点之间的路的条数是图的规模的指数次幂，为此将此模型转化为双层整数规划模型，鉴于双层整数规划模型在一般情况下是不可解的，通过探讨下层整数规划问题与其线性规划松弛之间的关系以及线性规划对偶理论来解此双层整数规划模型。本文不仅将该模型约束的个数从图的规模的指数次幂降到一次幂，...
Uložené v:
| Vydané v: | 中国工程科学 Ročník 17; číslo 1; s. 137 - 142 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | Chinese |
| Vydavateľské údaje: |
中国工程院战略咨询中心
2015
高等教育出版社有限公司 中国科学院大学工程管理与信息技术学院,北京,100049 |
| Predmet: | |
| ISSN: | 1009-1742, 2096-0034 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资源限制下，最大化中断网络流的可能性，即给定起点和终点的网络图，在资源有限的情况下，选择一些边设置监测点使得从起点到终点的所有路都包含尽可能多的已被设置中断点的边。在给定图中，两点之间的路的条数是图的规模的指数次幂，为此将此模型转化为双层整数规划模型，鉴于双层整数规划模型在一般情况下是不可解的，通过探讨下层整数规划问题与其线性规划松弛之间的关系以及线性规划对偶理论来解此双层整数规划模型。本文不仅将该模型约束的个数从图的规模的指数次幂降到一次幂，同时也提供了一种解双层整数规划问题的方法。 |
|---|---|
| AbstractList | 提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资源限制下，最大化中断网络流的可能性，即给定起点和终点的网络图，在资源有限的情况下，选择一些边设置监测点使得从起点到终点的所有路都包含尽可能多的已被设置中断点的边。在给定图中，两点之间的路的条数是图的规模的指数次幂，为此将此模型转化为双层整数规划模型，鉴于双层整数规划模型在一般情况下是不可解的，通过探讨下层整数规划问题与其线性规划松弛之间的关系以及线性规划对偶理论来解此双层整数规划模型。本文不仅将该模型约束的个数从图的规模的指数次幂降到一次幂，同时也提供了一种解双层整数规划问题的方法。 O221; 提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资源限制下，最大化中断网络流的可能性，即给定起点和终点的网络图，在资源有限的情况下，选择一些边设置监测点使得从起点到终点的所有路都包含尽可能多的已被设置中断点的边。在给定图中，两点之间的路的条数是图的规模的指数次幂，为此将此模型转化为双层整数规划模型，鉴于双层整数规划模型在一般情况下是不可解的，通过探讨下层整数规划问题与其线性规划松弛之间的关系以及线性规划对偶理论来解此双层整数规划模型。本文不仅将该模型约束的个数从图的规模的指数次幂降到一次幂，同时也提供了一种解双层整数规划问题的方法。 |
| Abstract_FL | This paper proposes a maximum reliable network interdiction model,which is to maximize the reliability of an interdicting network with limited resources by setting sensors in arcs to prevent any flow between given two nodes in a given graph even though some sensors could be failed,i.e.,given a directed graph with a source and a sink,several arcs need to be se-lected such that each path from the source to the sink contains as many arcs in the selected sub-set as possible. In any given graph,the number of paths between any given two nodes is expo-nential to the size of this graph,so this model is transferred to a bilevel program. We solve this bilevel integer program by finding out the relationship between the lower level integer program and its linear program relaxation,also using the duality theory because a bilevel program is in-tractable in common sense. Lastly,we reduce the number of the constraint to one order of the size of the graph from its exponential order. Besides,we also demonstrate an approach to re-solve the bilevel program. |
| Author | 赵佳 于华 |
| AuthorAffiliation | 中国科学院大学工程管理与信息技术学院,北京100049 |
| AuthorAffiliation_xml | – name: 中国科学院大学工程管理与信息技术学院,北京,100049 |
| Author_FL | Zhao Jia Yu Hua |
| Author_FL_xml | – sequence: 1 fullname: Zhao Jia – sequence: 2 fullname: Yu Hua |
| Author_xml | – sequence: 1 fullname: 赵佳 于华 |
| BookMark | eNpNjbtKA0EYRgeJYIx5AUsbq4V_LruzU0rwBgGb9MtkdnaNl4lmEC9VBBtJkdgIwioKQmyCVSAovk0yMW_hQlJYfcU5nG8VFUzT6CVUJCACD4CyAipiAOFhzsgKKlvbqAPDJCA-IUVEXXY_e-r9Du_cV2886risPXnvT7qfs-dX1-5Pfx6m35kb3o5HA_c4cB9vk5fOGlpO5InV5cWWUG1nu1bZ86oHu_uVraqneCi8WPr1gEsRhnHCsNAgtBKYUyokC-MQuGQKfBX7UmrOJAMWJIpozZSgXOs6LaHNefZSmkSaNDpqXrRMfhjdpKk6viKAfcCARW6uz00lrY2MtXEUBNQHGmLI4cYCHjZNet7IQ2etxqlsXf-T_gAxf2nv |
| ClassificationCodes | O221 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA NSCOK 2B. 4A8 92I 93N PSX TCJ |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 国家哲学社会科学文献中心 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | A maximum reliable network interdiction model with limited resources |
| DocumentTitle_FL | A maximum reliable network interdiction model with limited resources |
| EISSN | 2096-0034 |
| EndPage | 142 |
| ExternalDocumentID | zggckx201501019 663503810 |
| GrantInformation_xml | – fundername: 国家重点基础研究发展计划(973计划) funderid: (2011CB706900) |
| GroupedDBID | -0C -SC -S~ 2RA 5VR 92L 92M 92R 93N 9D9 9DC AAITT AFUIB ALMA_UNASSIGNED_HOLDINGS CAJEC CAJUS CQIGP CW7 FA0 GROUPED_DOAJ J.9 JUIAU M~T NSCOK NTYSC PB1 PB9 Q-- Q-2 R-C RT3 T8S U1F U5C W92 ~WA 2B. 4A8 92I PSX TCJ |
| ID | FETCH-LOGICAL-c789-da5b67a988df419e09ec917339a48d807a4c05cd5aae74a4046fc2ee4c937eeb3 |
| ISSN | 1009-1742 |
| IngestDate | Thu May 29 04:02:38 EDT 2025 Wed Nov 26 08:43:40 EST 2025 Wed Feb 14 10:35:00 EST 2024 |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 互补松弛型 线性规划松弛 k-可靠性 对偶 中断模型 k-reliability linear programming relaxation interdiction model duality com-plementary slackness |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c789-da5b67a988df419e09ec917339a48d807a4c05cd5aae74a4046fc2ee4c937eeb3 |
| Notes | 11-4421/G3 interdiction model;k-reliability;duality;linear programming relaxation;com-plementary slackness This paper proposes a maximum reliable network interdiction model,which is to maximize the reliability of an interdicting network with limited resources by setting sensors in arcs to prevent any flow between given two nodes in a given graph even though some sensors could be failed,i.e.,given a directed graph with a source and a sink,several arcs need to be se-lected such that each path from the source to the sink contains as many arcs in the selected sub-set as possible. In any given graph,the number of paths between any given two nodes is expo-nential to the size of this graph,so this model is transferred to a bilevel program. We solve this bilevel integer program by finding out the relationship between the lower level integer program and its linear program relaxation,also using the duality theory because a bilevel program is in-tractable in common sense. Lastly,we reduce the number of the constraint to o |
| OpenAccessLink | https://www.ncpssd.cn/Literature/articleinfo?id=663503810&type=journalArticle |
| PageCount | 6 |
| ParticipantIDs | wanfang_journals_zggckx201501019 cass_nssd_663503810 chongqing_primary_663503810 |
| PublicationCentury | 2000 |
| PublicationDate | 2015 2015-01-01 |
| PublicationDateYYYYMMDD | 2015-01-01 |
| PublicationDate_xml | – year: 2015 text: 2015 |
| PublicationDecade | 2010 |
| PublicationTitle | 中国工程科学 |
| PublicationTitleAlternate | Engineering Science |
| PublicationTitle_FL | Engineering Science |
| PublicationYear | 2015 |
| Publisher | 中国工程院战略咨询中心 高等教育出版社有限公司 中国科学院大学工程管理与信息技术学院,北京,100049 |
| Publisher_xml | – name: 中国工程院战略咨询中心 – name: 高等教育出版社有限公司 – name: 中国科学院大学工程管理与信息技术学院,北京,100049 |
| SSID | ssib041262522 ssib000271367 ssj0002857239 ssib051368723 ssib006564177 ssib017478303 ssib036436351 ssib044765437 |
| Score | 1.9986296 |
| Snippet | 提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资源限制... O221; 提出了最大可靠性网络流中断模型。此模型是在给定的网络图中，通过在边上设置监测点来阻止给定两个顶点之间的网络流量，同时考虑所设置监测点失效的可能，在给定的资... |
| SourceID | wanfang cass chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 137 |
| SubjectTerms | k-可靠性 中断模型 互补松弛型 对偶 线性规划松弛 |
| Title | 有限资源下最大可靠性网络流中断模型 |
| URI | http://lib.cqvip.com/qk/83379X/201501/663503810.html https://www.ncpssd.cn/Literature/articleinfo?id=663503810&type=journalArticle https://d.wanfangdata.com.cn/periodical/zggckx201501019 |
| Volume | 17 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2096-0034 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044765437 issn: 1009-1742 databaseCode: M~E dateStart: 19990101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR3LahRBsInBgx5Eo2KMyh5sPC3Mo2e6-9izO4sHDR6C5LbMc-ODSczGEHKQCF4kB-NFEKIoCPESPAWC4t9kJ-YvrOrp7E4eoB6EYaipqqnuqppHdU9XDSG3fZ678GpJmjGTaZOluWxGehGA72YsSrmd6tUWD-_x6WkxOysfjJ25c5gLs_yUF4VYWZEL_9XVgANnY-rsP7h7KBQQAIPTYQ9uh_1fOZ6GPpUtKiQNJZWwWTQUNPCoYEgKlMYwGggqgkNmwHhUMao4AqJDVUef3qbKQh5gQBKnQZtKWwMBnogCgd82AlVbC_QNoABjo0AZQlv1OLjGD9QAxQIQcKo8FK6qvnFsVGoJwKmGk4hGIdhQTJsG7ojCUEMRajXaANSnNaqUTn0JntaB480ZAyrniHEM6dTehlpfjhYW_qGRQw10NMlHW6FtAVDa7Nr-iDnRqNPSSrSo5EYt1QKkrcdbtZeJ_tUEZ86J-6h6WdhVuRsTd9iG72j179VeL3myggbCYoCYqOpKgZMM91-E9a_HWHlv9Bz1fGaP8otdiDohrhw-x5ntwKh3VLaRMY4ZxkN-D4QJbsLGx3oC1oNDqRcOGJUggklgdIcVSebmi94ziLN02luRR0WvFqHNXCQXzNCqoapb4hIZW52bIOdrBTcvE7fcfH3wfuPXzqvy-8be7nq5uTb4sjV48-3gw6dybWv_59v9H5vlzsu93e3y3Xb59fPg4_oVMtMJZ1p3m-a3Ic2EC9lMIy_2eSSFSHNmy8ySWSJt7royYiIVFo9YYnlJ6kVRxlnELObniZNlLIFIPcti9yoZL-aL7BppCJfHjo8RNhgps2KRMicTsczznPMs5pNkAo3QLfr9tIuhO352tybJ1NAm3YWqZkyd2jBW6pqHRr97zMnX_8wyRc4hXM0F3iDjS4vPs5vkbLK89Ki_eEtfHb8BeeKNmQ |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E6%9C%89%E9%99%90%E8%B5%84%E6%BA%90%E4%B8%8B%E6%9C%80%E5%A4%A7%E5%8F%AF%E9%9D%A0%E6%80%A7%E7%BD%91%E7%BB%9C%E6%B5%81%E4%B8%AD%E6%96%AD%E6%A8%A1%E5%9E%8B&rft.jtitle=%E4%B8%AD%E5%9B%BD%E5%B7%A5%E7%A8%8B%E7%A7%91%E5%AD%A6&rft.au=%E8%B5%B5%E4%BD%B3&rft.au=%E4%BA%8E%E5%8D%8E&rft.date=2015&rft.pub=%E4%B8%AD%E5%9B%BD%E7%A7%91%E5%AD%A6%E9%99%A2%E5%A4%A7%E5%AD%A6%E5%B7%A5%E7%A8%8B%E7%AE%A1%E7%90%86%E4%B8%8E%E4%BF%A1%E6%81%AF%E6%8A%80%E6%9C%AF%E5%AD%A6%E9%99%A2%2C%E5%8C%97%E4%BA%AC%2C100049&rft.issn=1009-1742&rft.issue=1&rft.spage=137&rft.epage=142&rft.externalDocID=zggckx201501019 |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F83379X%2F83379X.jpg http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fzggckx%2Fzggckx.jpg |