M
Michael Florian
Researcher at Université de Montréal
Publications - 134
Citations - 7779
Michael Florian is an academic researcher from Université de Montréal. The author has contributed to research in topics: Flow network & Variational inequality. The author has an hindex of 44, co-authored 134 publications receiving 7426 citations. Previous affiliations of Michael Florian include Université du Québec.
Papers
More filters
Journal ArticleDOI
Optimal strategies: A new assignment model for transit networks
Heinz Spiess,Michael Florian +1 more
TL;DR: A model for the transit assignment problem with a fixed set of transit lines is described, formulated as a linear programming problem of a size that increases linearly with the network size that solves the latter problem in polynomial time.
Journal ArticleDOI
Deterministic Production Planning: Algorithms and Complexity
TL;DR: In this paper, a class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs, and several algorithms proposed for their solution are described and analyzed.
Journal ArticleDOI
Deterministic production planning with concave costs and capacity constraints.
Michael Florian,Morton Klein +1 more
TL;DR: Florian M., M. Klein this paper proposed a deterministic production planning with concave costs and capacity constraints, which is based on the deterministic deterministic linear programming (DDP) model.
Journal ArticleDOI
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Graham McMahon,Michael Florian +1 more
TL;DR: An algorithm is developed for sequencing jobs on a single processor in order to minimize maximum lateness, subject to ready times and due dates, that has the unusual feature that a complete solution is associated with each node of the enumeration tree.
Journal ArticleDOI
A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria
TL;DR: A frequency-based route choice model for congested transit networks, which takes into account the consequences of congestion on the predicted flows as well as on the expected waiting and travel times and is a generalization of the previously known strategy (hyperpath) based transit network equilibrium models.