A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/mp/MortonRR85
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mp/MortonRR85
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/George_Morton
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Karl_Ringwald
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rabe_von_Randow
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2FBF01586094
>
foaf:
homepage
<
https://doi.org/10.1007/BF01586094
>
dc:
identifier
DBLP journals/mp/MortonRR85
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2FBF01586094
(xsd:string)
dcterms:
issued
1985
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/mp
>
rdfs:
label
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/George_Morton
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Karl_Ringwald
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rabe_von_Randow
>
swrc:
number
2
(xsd:string)
swrc:
pages
238-241
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mp/MortonRR85/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mp/MortonRR85
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mp/mp32.html#MortonRR85
>
rdfs:
seeAlso
<
https://doi.org/10.1007/BF01586094
>
dc:
title
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
32
(xsd:string)