On thek-cut subgraph polytope

Saved in:
Bibliographic Details
Published in:Mathematical programming 1994-10, Vol.67 (1-3), p.121-132
Main Authors: Talluri, Kalyan T., Wagner, Donald K.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43
cites cdi_FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43
container_end_page 132
container_issue 1-3
container_start_page 121
container_title Mathematical programming
container_volume 67
creator Talluri, Kalyan T.
Wagner, Donald K.
description
doi_str_mv 10.1007/BF01582217
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF01582217</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF01582217</sourcerecordid><originalsourceid>FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43</originalsourceid><addsrcrecordid>eNpFjz1LA0EUABcx4BnT2AtXC6vv7b79aDUYFQJp0h_78dao0TtuL0X-vYqC1XTDjBCXCDcI4G7vV4DGK4XuRDRI2kqyZE9FA6CMNBbhTJzX-gYAqL1vxNXms512_C7TYWrrIb6MYdi1Q78_Tv3AF2JWwr7y4o9zsV09bJdPcr15fF7erWVy1kmK2pscYszKOVM0JMUlfedg0UQ5s9WUHVqXIeSiOGfjo2LFxGgpkJ6L619tGvtaRy7dML5-hPHYIXQ_X93_l_4CDVA-iw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On thek-cut subgraph polytope</title><source>Springer Nature - Connect here FIRST to enable access</source><creator>Talluri, Kalyan T. ; Wagner, Donald K.</creator><creatorcontrib>Talluri, Kalyan T. ; Wagner, Donald K.</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>DOI: 10.1007/BF01582217</identifier><language>eng</language><ispartof>Mathematical programming, 1994-10, Vol.67 (1-3), p.121-132</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43</citedby><cites>FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Talluri, Kalyan T.</creatorcontrib><creatorcontrib>Wagner, Donald K.</creatorcontrib><title>On thek-cut subgraph polytope</title><title>Mathematical programming</title><issn>0025-5610</issn><issn>1436-4646</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNpFjz1LA0EUABcx4BnT2AtXC6vv7b79aDUYFQJp0h_78dao0TtuL0X-vYqC1XTDjBCXCDcI4G7vV4DGK4XuRDRI2kqyZE9FA6CMNBbhTJzX-gYAqL1vxNXms512_C7TYWrrIb6MYdi1Q78_Tv3AF2JWwr7y4o9zsV09bJdPcr15fF7erWVy1kmK2pscYszKOVM0JMUlfedg0UQ5s9WUHVqXIeSiOGfjo2LFxGgpkJ6L619tGvtaRy7dML5-hPHYIXQ_X93_l_4CDVA-iw</recordid><startdate>199410</startdate><enddate>199410</enddate><creator>Talluri, Kalyan T.</creator><creator>Wagner, Donald K.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199410</creationdate><title>On thek-cut subgraph polytope</title><author>Talluri, Kalyan T. ; Wagner, Donald K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Talluri, Kalyan T.</creatorcontrib><creatorcontrib>Wagner, Donald K.</creatorcontrib><collection>CrossRef</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Talluri, Kalyan T.</au><au>Wagner, Donald K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On thek-cut subgraph polytope</atitle><jtitle>Mathematical programming</jtitle><date>1994-10</date><risdate>1994</risdate><volume>67</volume><issue>1-3</issue><spage>121</spage><epage>132</epage><pages>121-132</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><doi>10.1007/BF01582217</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0025-5610
ispartof Mathematical programming, 1994-10, Vol.67 (1-3), p.121-132
issn 0025-5610
1436-4646
language eng
recordid cdi_crossref_primary_10_1007_BF01582217
source Springer Nature - Connect here FIRST to enable access
title On thek-cut subgraph polytope
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T10%3A28%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20thek-cut%20subgraph%20polytope&rft.jtitle=Mathematical%20programming&rft.au=Talluri,%20Kalyan%20T.&rft.date=1994-10&rft.volume=67&rft.issue=1-3&rft.spage=121&rft.epage=132&rft.pages=121-132&rft.issn=0025-5610&rft.eissn=1436-4646&rft_id=info:doi/10.1007/BF01582217&rft_dat=%3Ccrossref%3E10_1007_BF01582217%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c767-4b385dabbd2775f30c2efc0071f344dde634d7167d0adf2edd58b2e2e4e164a43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true