SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A BILEVEL PROGRAMMING APPROACH TO ESTIMATING O-D MATRIX BY TRAFFIC COUNTS
0 references·2 citing·5 second hop
A BILEVEL PROGRAMMING APPROACH TO ESTIMATING O-D MATRIX BY TRAFFIC COUNTS (1991)A BILEVEL PROGRAMMING APPROACH TO ESTIMAT…Congested O-D Trip Demand Adjustment Problem: Bilevel Programming Formulation and Optimality Conditions (1998)Congested O-D Trip Demand Adj…A Stochastic User Equilibrium (SUE) Path Flow Estimator for the Dedale Database in Lyon (1996)A Stochastic User Equilibrium…The existence, uniqueness and stability of traffic equilibria (1979)The most likely trip matrix estimated from traffic counts (1980)Traffic Equilibrium and Variational Inequalities (1980)Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator (1984)Linear programming and network flows (1991)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 1998Congested O-D Trip Demand Adjustment Problem: Bilevel Programming Formulation and Optimality Conditions9 cited
  • 1996A Stochastic User Equilibrium (SUE) Path Flow Estimator for the Dedale Database in Lyon6 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work