default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Florian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j24]Michael Florian, Siriphong Lawphongpanich:
Pricing in transportation networks. EURO J. Transp. Logist. 4(2): 195-196 (2015)- [j23]Calin D. Morosan, Michael Florian:
A network model for capped link-based tolls. EURO J. Transp. Logist. 4(2): 223-236 (2015) - 2012
- [j22]Michael Florian, Isabelle Constantin:
A note on logit choices in strategy transit assignment. EURO J. Transp. Logist. 1(1-2): 29-46 (2012) - 2008
- [j21]Michael Florian, Michael Mahut, Nicolas Tremblay:
Application of a simulation-based dynamic traffic assignment model. Eur. J. Oper. Res. 189(3): 1381-1392 (2008) - [j20]Michael Florian:
Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation. INFOR Inf. Syst. Oper. Res. 46(1): 29-50 (2008) - [j19]Teodor Gabriel Crainic
, Michael Florian:
National Planning Models and Instruments. INFOR Inf. Syst. Oper. Res. 46(4): 299-308 (2008) - 2007
- [j18]Christian S. Hahn, Bettina Fley, Michael Florian, Daniela Spresny, Klaus Fischer:
Social Reputation: a Mechanism for Flexible Self-Regulation of Multiagent Systems. J. Artif. Soc. Soc. Simul. 10(1) (2007) - 2006
- [j17]Christian S. Hahn, Bettina Fley, Michael Florian:
Self-regulation through social institutions: A framework for the design of open agent-based electronic marketplaces. Comput. Math. Organ. Theory 12(2-3): 181-204 (2006) - 2002
- [j16]Shane Velan, Michael Florian:
A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow. Transp. Sci. 36(4): 435-446 (2002) - 2001
- [j15]Michael Florian, Michel Gendreau:
Applications of parallel computing in transportation - introduction. Parallel Comput. 27(12): 1521-1522 (2001) - [j14]Nicolas Tremblay, Michael Florian:
Temporal shortest paths: Parallel computing implementations. Parallel Comput. 27(12): 1569-1609 (2001) - 1999
- [j13]Y. W. Xu, Jia Hao Wu, Michael Florian, Patrice Marcotte, Daoli Zhu:
Advances in the Continuous Dynamic Network Loading Problem. Transp. Sci. 33(4): 341-353 (1999) - 1996
- [j12]Michael Malsch, Michael Florian, Michael Jonas, Ingo Schulz-Schaefer:
Sozionik: Expedition ins Grenzgebiet zwischen Soziologie und Künstlicher Intelligenz. Künstliche Intell. 10(2): 6-12 (1996) - 1995
- [j11]Michael Florian, S. J. Thomas, R. V. M. Zahar:
On truncated-newton methods for solving the spatial price equilibrium problem. Networks 25(4): 177-182 (1995) - 1994
- [j10]Enrique Fernández, Joaquín de Cea, Michael Florian, Enrique Cabrera:
Network Equilibrium Models with Combined Modes. Transp. Sci. 28(3): 182-192 (1994) - [j9]Jia Hao Wu, Michael Florian, Patrice Marcotte:
Transit Equilibrium Assignment: A Model and Solution Algorithms. Transp. Sci. 28(3): 193-203 (1994) - 1993
- [j8]Jia Hao Wu, Michael Florian:
A simplicial decomposition method for the transit equilibrium assignment problem. Ann. Oper. Res. 44(3): 243-260 (1993) - [j7]Jia Hao Wu, Michael Florian, Patrice Marcotte:
A general descent framework for the monotone variational inequality problem. Math. Program. 61: 281-300 (1993) - 1990
- [j6]Teodor Gabriel Crainic, Michael Florian, José Eugênio Leal:
A Model for the Strategic Planning of National Freight Transportation by Rail. Transp. Sci. 24(1): 1-24 (1990) - [j5]Jacques Guélat, Michael Florian, Teodor Gabriel Crainic:
A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows. Transp. Sci. 24(1): 25-39 (1990) - 1987
- [j4]Michael Florian, Jacques Guélat, Heinz Spiess:
An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem. Networks 17(3): 319-339 (1987) - 1981
- [j3]Michael Florian, Sang Nguyen, Stefano Pallottino:
A dual simplex algorithm for finding all shortest paths. Networks 11(4): 367-378 (1981) - 1979
- [j2]R. Dionne, Michael Florian:
Exact and approximate algorithms for optimal network design. Networks 9(1): 37-59 (1979) - 1975
- [j1]Graham McMahon, Michael Florian:
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness. Oper. Res. 23(3): 475-482 (1975)
Conference and Workshop Papers
- 2005
- [c4]Klaus Fischer, Michael Florian:
Contribution of Socionics to the Scalability of Complex Social Systems: Introduction. Socionics 2005: 1-14 - [c3]Bettina Fley, Michael Florian:
Trust and the Economy of Symbolic Goods: A Contribution to the Scalability of Open Multi-agent Systems. Socionics 2005: 176-198 - [c2]Christian S. Hahn, Bettina Fley, Michael Florian:
A Framework for the Design of Self-Regulation of Open Agent-based Electronic Marketplaces. NORMAS 2005: 8-23 - 2002
- [c1]Michael Schillo, Klaus Fischer, Bettina Fley, Michael Florian, Frank Hillebrandt, Daniela Spresny:
FORM - A Sociologically Founded Framework for Designing Self-Organization of Multiagent Systems. RASTA 2002: 156-175
Editorship
- 2005
- [e1]Klaus Fischer, Michael Florian, Thomas Malsch:
Socionics - Scalability of Complex Social Systems. Lecture Notes in Computer Science 3413, Springer 2005, ISBN 3-540-30707-9 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
