The authors of the selected papers have the chance of improving the
earlier version of the corresponding extended abstracts, refining the
contents, adding new numerical results.
The due date for the new version will be April 18, 2001.
If we have not received the new version before this date we will count
only with the old one, provided it fits the following format requirements:
1. Maximum length of the revised version 6 pages (longer papers
will not be included)
2. Please e-mail your paper to Jaime
Barcelo as word or pdf file (postscript, tex, dvi etc. will not
3. Formats: Use Times New Roman, size 12, justified, page settings
1'' header, footer and margins, single space. Title centered
in bold followed by authors names and afilliations. Include the figures in
the text, number the figures. References by alphabetical order at the end
of the paper. Do not include footpages notes
The Definite to the Dynamic Traffic Assignment Problem
Prof. H. D. P: Lovecraft-Shelley
Department of Irreversible Systems
University of Miskatonik, 33 Gommergang Street, Avalon Islands
It is well known that in soite of the rearch
efforts in recent years, see Parker et al. 99 for an
excellent survey, the viscose nature of the
problem made very hard to encapsulate it in a
comprehensive formulation that could lead
to sound, efficient and accurate numerical
implementation. We are very glad to "annuntio vobis
magnum gaudium" inform the scientific community that we
have found the so anxiously expected solution, which we
expose in the following sections.
2: The nature of the problem
3. A new alternative formulation
L. Aaron, (1998), An unexpected formulation of the DTA, Journal of
Irreproducible Results, Vol. 43, No.5, pp. 73-85.
C. Parker, C. Mingus, J.L. Hooker and D.Z. Gillespie, (1999) The
unplayed music in the DTA concert, Scientific Transportation
Journal, Vol. 44, No.7, pp. 167-189.