A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory

A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming 1985, Vol.32 (2), p.238-241
Hauptverfasser: MORTON, G, VON RANDOW, R, RINGWALD, K
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Exact sciences and technology
Mathematical programming
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 241
container_issue 2
container_start_page 238
container_title Mathematical programming
container_volume 32
creator MORTON, G
VON RANDOW, R
RINGWALD, K
description
format Article
fullrecord <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_9228813</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>9228813</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_92288133</originalsourceid><addsrcrecordid>eNqNjE1uwjAQRq2KSg1t7zALtpGcH6KwRFWBA7BHU8cJrmyPNWPR5vaAxAFYfU96T9-LKqq26cq2a7uFKrSu1-W6q_SbWor8aq2rpu8LlbawZ2uHGdBPxC6fA4zEIOQvLk6AYDyKAI1gKF7sPySmiTGEu73xj7dBAOMALsu9idZkoAh_ty9I5OeAmckNkM-WeP5QryN6sZ-PfVer3ffx61AmFIN-ZIzGySmxC8jzaVPXfV81zZPZFdX9Tjg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory</title><source>SpringerLink Journals</source><creator>MORTON, G ; VON RANDOW, R ; RINGWALD, K</creator><creatorcontrib>MORTON, G ; VON RANDOW, R ; RINGWALD, K</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>CODEN: MHPGA4</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Mathematical programming, 1985, Vol.32 (2), p.238-241</ispartof><rights>1985 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=9228813$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>MORTON, G</creatorcontrib><creatorcontrib>VON RANDOW, R</creatorcontrib><creatorcontrib>RINGWALD, K</creatorcontrib><title>A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory</title><title>Mathematical programming</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</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>1985</creationdate><recordtype>article</recordtype><recordid>eNqNjE1uwjAQRq2KSg1t7zALtpGcH6KwRFWBA7BHU8cJrmyPNWPR5vaAxAFYfU96T9-LKqq26cq2a7uFKrSu1-W6q_SbWor8aq2rpu8LlbawZ2uHGdBPxC6fA4zEIOQvLk6AYDyKAI1gKF7sPySmiTGEu73xj7dBAOMALsu9idZkoAh_ty9I5OeAmckNkM-WeP5QryN6sZ-PfVer3ffx61AmFIN-ZIzGySmxC8jzaVPXfV81zZPZFdX9Tjg</recordid><startdate>1985</startdate><enddate>1985</enddate><creator>MORTON, G</creator><creator>VON RANDOW, R</creator><creator>RINGWALD, K</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>1985</creationdate><title>A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory</title><author>MORTON, G ; VON RANDOW, R ; RINGWALD, K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_92288133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>MORTON, G</creatorcontrib><creatorcontrib>VON RANDOW, R</creatorcontrib><creatorcontrib>RINGWALD, K</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>MORTON, G</au><au>VON RANDOW, R</au><au>RINGWALD, K</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory</atitle><jtitle>Mathematical programming</jtitle><date>1985</date><risdate>1985</risdate><volume>32</volume><issue>2</issue><spage>238</spage><epage>241</epage><pages>238-241</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><coden>MHPGA4</coden><cop>Heidelberg</cop><pub>Springer</pub></addata></record>
fulltext fulltext
identifier ISSN: 0025-5610
ispartof Mathematical programming, 1985, Vol.32 (2), p.238-241
issn 0025-5610
1436-4646
language eng
recordid cdi_pascalfrancis_primary_9228813
source SpringerLink Journals
subjects Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
title A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theory
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T22%3A47%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Greedy%20algorithm%20for%20solving%20a%20class%20of%20convex%20programming%20problems%20and%20its%20connect%20on%20with%20polymatroid%20theory&rft.jtitle=Mathematical%20programming&rft.au=MORTON,%20G&rft.date=1985&rft.volume=32&rft.issue=2&rft.spage=238&rft.epage=241&rft.pages=238-241&rft.issn=0025-5610&rft.eissn=1436-4646&rft.coden=MHPGA4&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E9228813%3C/pascalfrancis%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