Re: Elementary Math for the Traffic Problems

["Anh Le" <anh_t_le@hotmail.com>]

Hi ba'c Sonnet,

  Trong CS co' ba`i tu+o+ng tu+. - algorithm Ford-Fulkerson. Cho graph vo+'i 
ca'c egde ha.n che^' ve^` capacity, ti`m pha^n bo^' sao cho to^?ng lu+u 
lu+o+.ng ca'c do`ng cha?y giu+~a 2 ddie^?m la` lo+'n nha^'t. Ngu+o+`i ta 
ti`m tu+` edge co' minimal capacity, xong increment le^n da^`n (to^i cu~ng 
que^n ro^`i cu. the^? ro^`i, nhu+ng dda.i kha'i cu~ng ddo+n gia?n, obvious). 
Ma^'y algorithm loa.i na`y va^~n hay du`ng cho traffic control & simulation 
system o+? ca'c nu+o+'c. Gio?ng tai nghe model cu?a ba'c dda^y.

Thanks,
Tuan Anh.

P.S. Dda^y thuo^.c ve^` lu+'a algorithm cuo^'i cu`ng co' lo+`i gia?i "to^'t" 
(polinomial or better). Danh sa'ch ddo' dda~ ke^'t thu'c la^u la('m ro^`i, 
ca'i cuo^'i cu`ng bo.n to^i va^~n hay nghe la` cu?a Khatrian (spelling?), 
da`nh cho linear programming, with the logarithmic scale better than simplex 
method.
   La`ng ta hi`nh nhu+ co' ra^'t nhie^`u ba'c na('m ve^` optimization, 
operation research... Nga`nh ddo' u+'ng du.ng ddu+o+.c ro^.ng, ne^n so^'ng 
to^'t-:)

From: Sonnet Nguyen <sonnet@white.cft.edu.pl>
>Reply-To: vnsa@list-server.net
>To: vnsa@List-Server.net
>CC: Nguyen Aiviet <aiviet2@yahoo.com>
>Subject: Elementary Math for the Traffic Problems
>Date: Mon, 25 Oct 1999 18:16:33 +0200 (CEST)
>
>Hi Lovers of Thinking,

______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com