skip to content
Maximum payloads per unit time delivered through an air network. Preview this item
ClosePreview this item
Checking...

Maximum payloads per unit time delivered through an air network.

Author: George B Dantzig; Davil L Johnson; BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH.
Publisher: Ft. Belvoir Defense Technical Information Center JUN 1963.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Optimizing the flow of aircraft through a new work of bases requires some modification of the standard network flow algorithms because of the special nature of air transportation. The pay load carried by an airplane is a function of the distance between refueling stops, as well as field conditions at the bases; and in general the maximum allowable payload is not the same on all arcs of the network. Thus the shortest  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: George B Dantzig; Davil L Johnson; BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH.
OCLC Number: 227315763
Notes: Also available from the author.
Description: 11 pages

Abstract:

Optimizing the flow of aircraft through a new work of bases requires some modification of the standard network flow algorithms because of the special nature of air transportation. The pay load carried by an airplane is a function of the distance between refueling stops, as well as field conditions at the bases; and in general the maximum allowable payload is not the same on all arcs of the network. Thus the shortest route through a network is not necessarily the route of maximum payload flow per hour of flight time, a trivial example being a plane which can fly non-stop from origin to destination but only with zero payload. Two air network problems analogous to the shortest path and the maximum flow problems are considered. These are the route of maximum payload flow per hour of flight time and the maximum steady-state payload flow through a network with base capacity constraints. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/227315763> # Maximum payloads per unit time delivered through an air network.
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "227315763" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137056575#Place/ft_belvoir> ; # Ft. Belvoir
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/137056575#Topic/air_traffic> ; # Air traffic
   schema:about <http://experiment.worldcat.org/entity/work/data/137056575#Topic/payload> ; # Payload
   schema:about <http://experiment.worldcat.org/entity/work/data/137056575#Topic/air_transportation> ; # Air transportation
   schema:about <http://experiment.worldcat.org/entity/work/data/137056575#Topic/civil_aviation> ; # Civil aviation
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/17287797> ; # George B. Dantzig
   schema:contributor <http://experiment.worldcat.org/entity/work/data/137056575#Organization/boeing_scientific_research_labs_seattle_wash> ; # BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/137056575#Person/johnson_davil_l> ; # Davil L. Johnson
   schema:datePublished "JUN 1963" ;
   schema:datePublished "1963" ;
   schema:description "Optimizing the flow of aircraft through a new work of bases requires some modification of the standard network flow algorithms because of the special nature of air transportation. The pay load carried by an airplane is a function of the distance between refueling stops, as well as field conditions at the bases; and in general the maximum allowable payload is not the same on all arcs of the network. Thus the shortest route through a network is not necessarily the route of maximum payload flow per hour of flight time, a trivial example being a plane which can fly non-stop from origin to destination but only with zero payload. Two air network problems analogous to the shortest path and the maximum flow problems are considered. These are the route of maximum payload flow per hour of flight time and the maximum steady-state payload flow through a network with base capacity constraints. (Author)."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/137056575> ;
   schema:inLanguage "en" ;
   schema:name "Maximum payloads per unit time delivered through an air network."@en ;
   schema:productID "227315763" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227315763#PublicationEvent/ft_belvoirdefense_technical_information_centerjun_1963> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/137056575#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227315763> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/137056575#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/137056575#Organization/boeing_scientific_research_labs_seattle_wash> # BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH.
    a schema:Organization ;
   schema:name "BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH." ;
    .

<http://experiment.worldcat.org/entity/work/data/137056575#Person/johnson_davil_l> # Davil L. Johnson
    a schema:Person ;
   schema:familyName "Johnson" ;
   schema:givenName "Davil L." ;
   schema:name "Davil L. Johnson" ;
    .

<http://viaf.org/viaf/17287797> # George B. Dantzig
    a schema:Person ;
   schema:familyName "Dantzig" ;
   schema:givenName "George B." ;
   schema:name "George B. Dantzig" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.