The following pages link to Michael Florian (Q1308664):
Displaying 50 items.
- (Q235265) (redirect page) (← links)
- A simplicial decomposition method for the transit equilibrium assignment problem (Q1308665) (← links)
- A general descent framework for the monotone variational inequality problem (Q1315420) (← links)
- An active constraints Newton algorithm for the spatial price equilibrium problem (Q1319575) (← links)
- Applications of parallel computing in transportation (Q1603556) (← links)
- Application of a simulation-based dynamic traffic assignment model (Q2482809) (← links)
- (Q3061961) (← links)
- (Q3212890) (← links)
- (Q3372288) (← links)
- (Q3528712) (← links)
- A spatial price equilibrium model in the oligopolistic market for oil derivatives: an application to the brazilian scenario (Q3621502) (← links)
- (Q3720325) (← links)
- Nonlinear cost network models in transportation analysis (Q3747201) (← links)
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem (Q3792510) (← links)
- (Q3872199) (← links)
- Deterministic Production Planning: Algorithms and Complexity (Q3890384) (← links)
- A dual simplex algorithm for finding all shortest paths (Q3926369) (← links)
- (Q3929538) (← links)
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness (Q4055376) (← links)
- Scheduling with earliest start and due date constraints on multiple machines (Q4062910) (← links)
- The Engine Scheduling Problem In A Railway Network (Q4142994) (← links)
- Exact and approximate algorithms for optimal network design (Q4182675) (← links)
- Network Equilibrium Models with Combined Modes (Q4319309) (← links)
- Transit Equilibrium Assignment: A Model and Solution Algorithms (Q4319310) (← links)
- (Q4352983) (← links)
- (Q4363172) (← links)
- (Q4394594) (← links)
- A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow (Q4408710) (← links)
- (Q4495152) (← links)
- A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows (Q4712105) (← links)
- (Q4729635) (← links)
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions (Q4764597) (← links)
- (Q4811399) (← links)
- (Q4811401) (← links)
- Deterministic Production Planning with Concave Costs and Capacity Constraints (Q5181063) (← links)
- (Q5181520) (← links)
- (Q5494145) (← links)
- (Q5598827) (← links)
- A Direct Search Method to Locate Negative Cycles in a Graph (Q5616604) (← links)
- (Q5627898) (← links)
- A Direct Search Method to Locate Negative Cycles in a Graph (Q5630837) (← links)
- (Q5641011) (← links)
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem (Q5650540) (← links)
- On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (Q5671775) (← links)
- (Q5687197) (← links)
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach (Q5689979) (← links)
- (Q5689980) (← links)
- Temporal shortest paths: Parallel computing implementations (Q5958151) (← links)
- National Planning Models and Instruments (Q6102879) (← links)
- Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation (Q6160340) (← links)
