doorgaan naar inhoud
Finding minimum-cost circulations by successive approximation Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Finding minimum-cost circulations by successive approximation

Auteur: Andrew V Goldberg; Robert E Tarjan
Uitgever: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1987.
Serie: MIT/LCS/TM, 333.
Editie/Formaat:   Print book : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Andrew V Goldberg; Robert E Tarjan
OCLC-nummer: 18484222
Opmerkingen: "July 1987."
"A preliminary version of this paper appeared in the Proceedings of the Nineteenth Annual A.C.M. Symposium on Theory of Computing, May 25-27, 1987."
Beschrijving: 53 pages : illustrations ; 28 cm.
Serietitel: MIT/LCS/TM, 333.
Verantwoordelijkheid: Andrew V. Goldberg, Robert E. Tarjan.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.
Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


Primary Entity

<http://www.worldcat.org/oclc/18484222> # Finding minimum-cost circulations by successive approximation
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "18484222" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/17724240#Place/cambridge_mass> ; # Cambridge, Mass.
   schema:about <http://id.worldcat.org/fast/1070715> ; # Polynomials
   schema:about <http://experiment.worldcat.org/entity/work/data/17724240#Topic/netzwerk> ; # Netzwerk
   schema:about <http://id.worldcat.org/fast/811829> ; # Approximation theory
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/17724240#Topic/polynom> ; # Polynom
   schema:about <http://experiment.worldcat.org/entity/work/data/17724240#Topic/approximation> ; # Approximation
   schema:about <http://experiment.worldcat.org/entity/work/data/17724240#Topic/algorithmus> ; # Algorithmus
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/73933029> ; # Robert Endre Tarjan
   schema:creator <http://experiment.worldcat.org/entity/work/data/17724240#Person/goldberg_andrew_v> ; # Andrew V. Goldberg
   schema:datePublished "1987" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/17724240> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/17724240#Series/mit_lcs_tm> ; # MIT/LCS/TM ;
   schema:name "Finding minimum-cost circulations by successive approximation"@en ;
   schema:productID "18484222" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/18484222#PublicationEvent/cambridge_mass_laboratory_for_computer_science_massachusetts_institute_of_technology_1987> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/17724240#Agent/laboratory_for_computer_science_massachusetts_institute_of_technology> ; # Laboratory for Computer Science, Massachusetts Institute of Technology
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/18484222> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/17724240#Agent/laboratory_for_computer_science_massachusetts_institute_of_technology> # Laboratory for Computer Science, Massachusetts Institute of Technology
    a bgn:Agent ;
   schema:name "Laboratory for Computer Science, Massachusetts Institute of Technology" ;
    .

<http://experiment.worldcat.org/entity/work/data/17724240#Person/goldberg_andrew_v> # Andrew V. Goldberg
    a schema:Person ;
   schema:familyName "Goldberg" ;
   schema:givenName "Andrew V." ;
   schema:name "Andrew V. Goldberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/17724240#Place/cambridge_mass> # Cambridge, Mass.
    a schema:Place ;
   schema:name "Cambridge, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/17724240#Series/mit_lcs_tm> # MIT/LCS/TM ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/18484222> ; # Finding minimum-cost circulations by successive approximation
   schema:name "MIT/LCS/TM ;" ;
   schema:name "MIT/LCS/TM- ;" ;
    .

<http://id.worldcat.org/fast/1070715> # Polynomials
    a schema:Intangible ;
   schema:name "Polynomials"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/811829> # Approximation theory
    a schema:Intangible ;
   schema:name "Approximation theory"@en ;
    .

<http://viaf.org/viaf/73933029> # Robert Endre Tarjan
    a schema:Person ;
   schema:birthDate "1948" ;
   schema:familyName "Tarjan" ;
   schema:givenName "Robert Endre" ;
   schema:givenName "Robert E." ;
   schema:name "Robert Endre Tarjan" ;
    .


Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.