Reducibility of stochastic networks
This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particul...
Gespeichert in:
| Veröffentlicht in: | Omega (Oxford) 1985, Vol.13 (3), p.223-232 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 232 |
|---|---|
| container_issue | 3 |
| container_start_page | 223 |
| container_title | Omega (Oxford) |
| container_volume | 13 |
| creator | DODIN, B |
| description | This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particular reduction and use it to characterize the reducibility of such a network. The network can be reduced to one equivalent activity if the network does not have a special graph which we call the 'interdictive graph', or IG for short. If an IG is embedded in the network, the network is irreducible. In this case, its reduction becomes possible by duplicating some of the arcs in the irreducible network. The concept of duplicating an arc is introduced, then it is used to identify the arcs which can be duplicated. The reduction procedure is stated and illustrative examples are provided. An upper bound on the number of duplications is established. |
| doi_str_mv | 10.1016/0305-0483(85)90060-X |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1311289585</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1311289585</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-ade47aab94afa27b6d5cdebec9bc78f707eccaece52aedb263b2934ddc9404ab3</originalsourceid><addsrcrecordid>eNo9UE1LAzEQDaJgrf4DD4V60MNqPjfZo4ifFARR6C1MsrN2a9tdk63Sf2_Wlh7mg-G9N_OGkHNGrxll-Q0VVGVUGnFp1FVBaU6z6QEZMKNFpriWh2SwhxyTkxjnlFJmqBiQ8RuWa1-7elF3m1FTjWLX-BnErvajFXa_TfiKp-SogkXEs10dko-H-_e7p2zy-vh8dzvJvNCiy6BEqQFcIaECrl1eKl-iQ184r02lqUbvAT0qDlg6ngvHCyHL0heSSnBiSMZb3TY032uMnZ0367BKKy0TjHFTKKMSSm5RPjQxBqxsG-olhI1l1PbvsL1X23u1Rtn_d9hpor1saQFb9HsOIs6bJX6C_bECmEhp0zdFogqoU_SjNgXnwnLB7axbJrGL3aUQPSyqACtfx71owZTUUok_JAZ5UQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1311289585</pqid></control><display><type>article</type><title>Reducibility of stochastic networks</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><source>Periodicals Index Online</source><creator>DODIN, B</creator><creatorcontrib>DODIN, B</creatorcontrib><description>This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particular reduction and use it to characterize the reducibility of such a network. The network can be reduced to one equivalent activity if the network does not have a special graph which we call the 'interdictive graph', or IG for short. If an IG is embedded in the network, the network is irreducible. In this case, its reduction becomes possible by duplicating some of the arcs in the irreducible network. The concept of duplicating an arc is introduced, then it is used to identify the arcs which can be duplicated. The reduction procedure is stated and illustrative examples are provided. An upper bound on the number of duplications is established.</description><identifier>ISSN: 0305-0483</identifier><identifier>EISSN: 1873-5274</identifier><identifier>DOI: 10.1016/0305-0483(85)90060-X</identifier><identifier>CODEN: OMEGA6</identifier><language>eng</language><publisher>Exeter: Elsevier</publisher><subject>Applied sciences ; Exact sciences and technology ; Operational research and scientific management ; Operational research. Management science ; Planning. Forecasting</subject><ispartof>Omega (Oxford), 1985, Vol.13 (3), p.223-232</ispartof><rights>1985 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-ade47aab94afa27b6d5cdebec9bc78f707eccaece52aedb263b2934ddc9404ab3</citedby><cites>FETCH-LOGICAL-c373t-ade47aab94afa27b6d5cdebec9bc78f707eccaece52aedb263b2934ddc9404ab3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,3996,4012,27852,27906,27907,27908</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=9154745$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeejomega/v_3a13_3ay_3a1985_3ai_3a3_3ap_3a223-232.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>DODIN, B</creatorcontrib><title>Reducibility of stochastic networks</title><title>Omega (Oxford)</title><description>This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particular reduction and use it to characterize the reducibility of such a network. The network can be reduced to one equivalent activity if the network does not have a special graph which we call the 'interdictive graph', or IG for short. If an IG is embedded in the network, the network is irreducible. In this case, its reduction becomes possible by duplicating some of the arcs in the irreducible network. The concept of duplicating an arc is introduced, then it is used to identify the arcs which can be duplicated. The reduction procedure is stated and illustrative examples are provided. An upper bound on the number of duplications is established.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Planning. Forecasting</subject><issn>0305-0483</issn><issn>1873-5274</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1985</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><sourceid>K30</sourceid><recordid>eNo9UE1LAzEQDaJgrf4DD4V60MNqPjfZo4ifFARR6C1MsrN2a9tdk63Sf2_Wlh7mg-G9N_OGkHNGrxll-Q0VVGVUGnFp1FVBaU6z6QEZMKNFpriWh2SwhxyTkxjnlFJmqBiQ8RuWa1-7elF3m1FTjWLX-BnErvajFXa_TfiKp-SogkXEs10dko-H-_e7p2zy-vh8dzvJvNCiy6BEqQFcIaECrl1eKl-iQ184r02lqUbvAT0qDlg6ngvHCyHL0heSSnBiSMZb3TY032uMnZ0367BKKy0TjHFTKKMSSm5RPjQxBqxsG-olhI1l1PbvsL1X23u1Rtn_d9hpor1saQFb9HsOIs6bJX6C_bECmEhp0zdFogqoU_SjNgXnwnLB7axbJrGL3aUQPSyqACtfx71owZTUUok_JAZ5UQ</recordid><startdate>1985</startdate><enddate>1985</enddate><creator>DODIN, B</creator><general>Elsevier</general><general>Pergamon Press</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JSICY</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope></search><sort><creationdate>1985</creationdate><title>Reducibility of stochastic networks</title><author>DODIN, B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-ade47aab94afa27b6d5cdebec9bc78f707eccaece52aedb263b2934ddc9404ab3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Planning. Forecasting</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>DODIN, B</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Periodicals Index Online Segment 36</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access & Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><jtitle>Omega (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>DODIN, B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reducibility of stochastic networks</atitle><jtitle>Omega (Oxford)</jtitle><date>1985</date><risdate>1985</risdate><volume>13</volume><issue>3</issue><spage>223</spage><epage>232</epage><pages>223-232</pages><issn>0305-0483</issn><eissn>1873-5274</eissn><coden>OMEGA6</coden><abstract>This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particular reduction and use it to characterize the reducibility of such a network. The network can be reduced to one equivalent activity if the network does not have a special graph which we call the 'interdictive graph', or IG for short. If an IG is embedded in the network, the network is irreducible. In this case, its reduction becomes possible by duplicating some of the arcs in the irreducible network. The concept of duplicating an arc is introduced, then it is used to identify the arcs which can be duplicated. The reduction procedure is stated and illustrative examples are provided. An upper bound on the number of duplications is established.</abstract><cop>Exeter</cop><pub>Elsevier</pub><doi>10.1016/0305-0483(85)90060-X</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0483 |
| ispartof | Omega (Oxford), 1985, Vol.13 (3), p.223-232 |
| issn | 0305-0483 1873-5274 |
| language | eng |
| recordid | cdi_proquest_journals_1311289585 |
| source | RePEc; Elsevier ScienceDirect Journals; Periodicals Index Online |
| subjects | Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Planning. Forecasting |
| title | Reducibility of stochastic networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T18%3A18%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reducibility%20of%20stochastic%20networks&rft.jtitle=Omega%20(Oxford)&rft.au=DODIN,%20B&rft.date=1985&rft.volume=13&rft.issue=3&rft.spage=223&rft.epage=232&rft.pages=223-232&rft.issn=0305-0483&rft.eissn=1873-5274&rft.coden=OMEGA6&rft_id=info:doi/10.1016/0305-0483(85)90060-X&rft_dat=%3Cproquest_cross%3E1311289585%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1311289585&rft_id=info:pmid/&rfr_iscdi=true |