Elementary solution to the jeep problem with two vehicles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F11%3A00448311" target="_blank" >RIV/60162694:G43__/11:00448311 - isvavai.cz</a>
Result on the web
<a href="http://vavtest.unob.cz/registr" target="_blank" >http://vavtest.unob.cz/registr</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Elementary solution to the jeep problem with two vehicles
Original language description
The jeep problem is a well known logistics problem. A jeep must cross a desert wider than it can travel on one tank of fuel with the help of optimal arrangement of fuel dumps along the route. The available resources refer, especially, to solutions of twobasic variants ? the single jeep problem and the convoy of jeeps problem. This contribution deals with one modification of the jeep problem with 2 vehicles and n cans of fuel (n > 2). Elementary solutions to this modification are derived and illustratedfor small amounts n of cans of fuel. General solution to this problem is also stated. Numerical solutions for some amounts of fuel, computed by the programming language of the computer algebra system Maple, are presented too.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Sborník příspěvků 7. konference o matematice a fyzice na vysokých školách technických , část 1 - matematika
ISBN
978-80-7231-815-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
345-352
Publisher name
FVT UO, Brno
Place of publication
Brno
Event location
Brno
Event date
Sep 22, 2011
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)