Towards a Temporal Extension of Spatial Allocation Modeling
暂无分享,去创建一个
[1] Alan T. Murray. Spatial restrictions in harvest scheduling , 1999 .
[2] D. Peuquet. Time in GIS and geographical databases , 2005 .
[3] Harvey J. Miller,et al. Measuring Space‐Time Accessibility Benefits within Transportation Networks: Basic Theory and Computational Procedures , 1999 .
[4] Maria Grazia Scutellà,et al. Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights , 2002, Transp. Sci..
[5] Guy Desaulniers,et al. The Shortest Path Problem with Time Windows and Linear Waiting Costs , 1997, Transp. Sci..
[6] Robert L. Smith,et al. A MIXED INTEGER LINEAR PROGRAMMING MODEL FOR DYNAMIC ROUTE GUIDANCE , 1998 .
[7] E. Sue Weber,et al. Systems to Think With: A Response to "A Vision for Decision Support Systems" , 1986, J. Manag. Inf. Syst..
[8] C. Dana Tomlin,et al. Decomposing Integer Programming Models for Spatial Allocation , 2002, GIScience.
[9] Hani S. Mahmassani,et al. A note on least time path computation considering delays and prohibitions for intersection movements , 1996 .
[10] Justin C. Williams. A Zero-One Programming Model for Contiguous Land Acquisition , 2002 .
[11] Peter J. Taylor. Distances within Shapes: An Introduction to a Family of Finite Frequency Distributions , 1971 .
[12] Bruce N Janson,et al. Dynamic traffic assignment for urban road networks , 1991 .
[13] Justin C. Williams. Convex Land Acquisition with Zero-One Programming , 2003 .
[14] J. T. Diamond,et al. Design of an Integrated Spatial Information System for Multiobjective Land-Use Planning , 1988 .
[15] G. Langran. Time in Geographic Information Systems , 1990 .
[16] Ismail Chabini,et al. Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .
[17] H. L. Scheurman,et al. Techniques for Prescribing Optimal Timber Harvest and Investment Under Different Objectives—Discussion and Synthesis , 1977 .
[18] M. Egenhofer,et al. Point-Set Topological Spatial Relations , 2001 .
[19] Harvey J. Miller,et al. GIS Software for Measuring Space-Time Accessibility in Transportation Planning and Analysis , 2000, GeoInformatica.
[20] Marc E. McDill,et al. Harvest scheduling with area-based adjacency constraints , 2002 .
[21] Deepak K. Merchant,et al. A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .
[22] Dfl Dorling,et al. Geographic Information Research: Bridging the Atlantic , 1996 .
[23] F. Barahona,et al. A column generation algorithm for solving general forest planning problems with adjacency constraints , 1994 .
[24] Charles ReVelle,et al. Temporal and spatial harvesting of irregular systems of parcels , 1996 .
[25] Takeshi Shirabe,et al. Modeling Topological Properties of a Raster Region for Spatial Optimization , 2004, SDH.
[26] Ola Sallnäs,et al. Harvest scheduling under adjacency constraints — a case study from the Swedish sub‐alpine region , 1993 .
[27] Paul J. Densham. Integrating GIS and spatial modelling: visual interactive modelling and location selection , 1994 .
[28] Travé-Massuyès. Conceptual Neighborhood and its role in temporal and spatial reasoning , 1991 .
[29] Åke E. Andersson,et al. Systems analysis in forestry and forest industries , 1986 .
[30] R. Ahuja,et al. Minimum time and minimum cost path problems in street networks with traffic lights , 1999 .
[31] Andrew U. Frank,et al. Life and motion of socio-economic units , 2001 .
[32] J. D. Brodie,et al. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. , 1990 .
[33] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[34] B. Bruce Bare,et al. Spatially constrained timber harvest scheduling , 1989 .