SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "LAR1:ltu ;srt2:(1990-1999);pers:(Migdalas Athanasios)"

Sökning: LAR1:ltu > (1990-1999) > Migdalas Athanasios

  • Resultat 1-10 av 38
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  • Damberg, Olof, et al. (författare)
  • Distributed Disaggregate Simplicial Decomposition : A Parallel Algorithm for Traffic Assignment
  • 1997
  • Ingår i: Network Optimization. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 9783540625414 - 9783642591792 ; , s. 172-193
  • Bokkapitel (refereegranskat)abstract
    • In this work we present a parallel algorithm for the user equilibrium traffic assignment problem. The algorithm is based on the concepts of simplicial decomposition, regularization and partial linearization. The parallel implementation is a synchronous, single program multiple data, algorithm using local load balancing. PVM is used for communication purposes. We present numerical results for two parallel platforms: a DEC Alpha cluster and a Parsytec GC/PowerPlus and for three real world traffic networks. The results show moderate speed-up with increasing efficiency for increasing OD-pair to link ratio
  •  
4.
  •  
5.
  • Damberg, Olof, et al. (författare)
  • Parallel Algorithms for Network Problems
  • 1997
  • Ingår i: Parallel Algorithms for Network Problems. - Boston, MA : Encyclopedia of Global Archaeology/Springer Verlag. - 9781461334026 - 9781461334002 ; , s. 183-238
  • Bokkapitel (refereegranskat)abstract
    • In this chapter we review parallel algorithms for some linear network problems, with special emphasis on the bipartite assignment problem. The many-to-one assignment problem is considered, and a breadth-first-search algorithm for finding augmenting paths is exemplified. We also review parallel algorithms for single- and multicommodity network problems with convex objective functions. A simplicial decomposition approach to the traffic assignment problem is presented and an SPMD implementation is given.
  •  
6.
  •  
7.
  •  
8.
  •  
9.
  • Helgason, Thorkell, et al. (författare)
  • Maxmin Formulation of the Apportionments of Seats to a Parliament
  • 1995
  • Ingår i: Minimax and Applications. - New York : Encyclopedia of Global Archaeology/Springer Verlag. - 9781461335597 - 9781461335573 ; , s. 109-118
  • Bokkapitel (refereegranskat)abstract
    • We consider the problem of apportioning a fixed number of seats in a national parliament to the candidates of different parties that are elected in constituencies so as to meet party and constituency constraints. We propose a maxmin formulation of the problem. The purpose is to obtain a fair apportionment of the parliament seats, in the sense that the minimum number of voters behind any possible parliament majority is maximum. We illustrate the concepts with some examples, including an example from the last Icelandic election
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 38

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy