Implementing an efficient minimum capacity cut algorithm

Implementing an efficient minimum capacity cut algorithm

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming 1994-10, Vol.67 (3), p.325-341
Hauptverfasser: NAGAMOCHI, H, ONO, T, IBARAKI, T
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 341
container_issue 3
container_start_page 325
container_title Mathematical programming
container_volume 67
creator NAGAMOCHI, H
ONO, T
IBARAKI, T
description
doi_str_mv 10.1007/bf01582226
format Article
fullrecord <record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF01582226</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3332915</sourcerecordid><originalsourceid>FETCH-LOGICAL-c326t-227af8977a902ec53e28362ccdc31ecc73ff5f6a46eb616bc893b3b6593028d73</originalsourceid><addsrcrecordid>eNo9j01LAzEURYMoOFY3_oJZuBJGX_ImH7PUYrVQcKPrIfOa1MhkOiTTRf-9lVZXlwvnXjiM3XJ44AD6sfPApRFCqDNW8BpVVatanbMCQMhKKg6X7CrnbwDgaEzBzDKOvYtumMKwKe1QOu8DhUMvYxhC3MWS7GgpTPuSdlNp-802hekrXrMLb_vsbk45Y5-Ll4_5W7V6f13On1YVoVBTJYS23jRa2waEI4lOGFSCaE3IHZFG76VXtlauU1x1ZBrssFOyQRBmrXHG7o-_lLY5J-fbMYVo077l0P46t8-LP-cDfHeER5vJ9j7ZgUL-XyCiaLjEH4H-VZo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Implementing an efficient minimum capacity cut algorithm</title><source>SpringerLink Journals - AutoHoldings</source><creator>NAGAMOCHI, H ; ONO, T ; IBARAKI, T</creator><creatorcontrib>NAGAMOCHI, H ; ONO, T ; IBARAKI, T</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>DOI: 10.1007/bf01582226</identifier><identifier>CODEN: MHPGA4</identifier><language>eng</language><publisher>Heidelberg: 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>Mathematical programming, 1994-10, Vol.67 (3), p.325-341</ispartof><rights>1995 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c326t-227af8977a902ec53e28362ccdc31ecc73ff5f6a46eb616bc893b3b6593028d73</citedby><cites>FETCH-LOGICAL-c326t-227af8977a902ec53e28362ccdc31ecc73ff5f6a46eb616bc893b3b6593028d73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=3332915$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>NAGAMOCHI, H</creatorcontrib><creatorcontrib>ONO, T</creatorcontrib><creatorcontrib>IBARAKI, T</creatorcontrib><title>Implementing an efficient minimum capacity cut algorithm</title><title>Mathematical programming</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>0025-5610</issn><issn>1436-4646</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNo9j01LAzEURYMoOFY3_oJZuBJGX_ImH7PUYrVQcKPrIfOa1MhkOiTTRf-9lVZXlwvnXjiM3XJ44AD6sfPApRFCqDNW8BpVVatanbMCQMhKKg6X7CrnbwDgaEzBzDKOvYtumMKwKe1QOu8DhUMvYxhC3MWS7GgpTPuSdlNp-802hekrXrMLb_vsbk45Y5-Ll4_5W7V6f13On1YVoVBTJYS23jRa2waEI4lOGFSCaE3IHZFG76VXtlauU1x1ZBrssFOyQRBmrXHG7o-_lLY5J-fbMYVo077l0P46t8-LP-cDfHeER5vJ9j7ZgUL-XyCiaLjEH4H-VZo</recordid><startdate>199410</startdate><enddate>199410</enddate><creator>NAGAMOCHI, H</creator><creator>ONO, T</creator><creator>IBARAKI, T</creator><general>Springer</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199410</creationdate><title>Implementing an efficient minimum capacity cut algorithm</title><author>NAGAMOCHI, H ; ONO, T ; IBARAKI, T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c326t-227af8977a902ec53e28362ccdc31ecc73ff5f6a46eb616bc893b3b6593028d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</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>NAGAMOCHI, H</creatorcontrib><creatorcontrib>ONO, T</creatorcontrib><creatorcontrib>IBARAKI, T</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>NAGAMOCHI, H</au><au>ONO, T</au><au>IBARAKI, T</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Implementing an efficient minimum capacity cut algorithm</atitle><jtitle>Mathematical programming</jtitle><date>1994-10</date><risdate>1994</risdate><volume>67</volume><issue>3</issue><spage>325</spage><epage>341</epage><pages>325-341</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><coden>MHPGA4</coden><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/bf01582226</doi><tpages>17</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0025-5610
ispartof Mathematical programming, 1994-10, Vol.67 (3), p.325-341
issn 0025-5610
1436-4646
language eng
recordid cdi_crossref_primary_10_1007_BF01582226
source SpringerLink Journals - AutoHoldings
subjects Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
title Implementing an efficient minimum capacity cut algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T22%3A09%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Implementing%20an%20efficient%20minimum%20capacity%20cut%20algorithm&rft.jtitle=Mathematical%20programming&rft.au=NAGAMOCHI,%20H&rft.date=1994-10&rft.volume=67&rft.issue=3&rft.spage=325&rft.epage=341&rft.pages=325-341&rft.issn=0025-5610&rft.eissn=1436-4646&rft.coden=MHPGA4&rft_id=info:doi/10.1007/bf01582226&rft_dat=%3Cpascalfrancis_cross%3E3332915%3C/pascalfrancis_cross%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