Sciweavers

49 search results - page 1 / 10
» A fast polynomial time algorithm for logistics network flows
Sort
View
JDCTA
2010
148views more  JDCTA 2010»
13 years 2 months ago
Application Research on Optimal Path Based on Genetic Algorithm
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
Lilin Fan, Huili Meng
SPAA
2003
ACM
14 years 21 days ago
Polynomial time algorithms for network information flow
Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolh...
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...